Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [2]	Hilfe

Suche: Series=LNCS AND YEAR=1994

• Formal derivation of SIMD parallelism from non-linear recursive specifications
  A. Max Geerling
  Lecture Notes in Computer Science 854, 1994, pp. 136-147
• Deriving efficient parallel implementations of algorithms operating on general sparse matrices using automatic program transformation
  Stephen Fitzpatrick, T.J. Harmer, J.M. Boyle
  Lecture Notes in Computer Science 854, 1994, pp. 148-159
• TOP^2 tool suite for the development and testing of parallel applications
  Ulrich Detert, Michael Gerndt
  Lecture Notes in Computer Science 854, 1994, pp. 196-207
• Vectorization of the radix r self-sorting FFT
  Margarita Amor, María J. Martín, Dora Blanco, Oscar G. Plata, Francisco F. Rivera, Francisco Argüello
  Lecture Notes in Computer Science 854, 1994, pp. 208-217
• Efficient Gram-Schmidt orthogonalisation on an array processor
  M. Clint, J.S. Weston, J.B. Flannagan
  Lecture Notes in Computer Science 854, 1994, pp. 218-228
• Parallelization of non-simultaneous iterative methods for systems of linear equations
  Beniamino Di Martino, Giulio Iannello
  Lecture Notes in Computer Science 854, 1994, pp. 253-264
• Paradigms admitting superunitary behaviour in parallel computation
  Selim G. Akl, Lorrie Fava Lindon
  Lecture Notes in Computer Science 854, 1994, pp. 301-312
• Parallel computation of modular multivariate polynomial resultants on a shared memory machine
  Hoon Hong, Hans Wolfgang Loidl
  Lecture Notes in Computer Science 854, 1994, pp. 325-336
• Comparing two probabilistic models of the computational complexity of the branch and bound algorithm
  Michèle Dion, Marc Gengler, Stéphane Ubéda
  Lecture Notes in Computer Science 854, 1994, pp. 359-370
• Parallel heap construction using multiple selection
  Jingsen Chen
  Lecture Notes in Computer Science 854, 1994, pp. 371-380
• Engineering high quality parallel software using PARSE
  Ian Gorton, Toong Shoon Chan, Innes Jelly
  Lecture Notes in Computer Science 854, 1994, pp. 381-392
• A comparison of shared virtual memory and message passing programming techniques based on a finite element application
  Rudolf Berrendorf, Michael Gerndt, Zakaria Lahjomri, Thierry Priol
  Lecture Notes in Computer Science 854, 1994, pp. 461-472
• Comparison between a message passing and a global shared memory parallel computer by means of a concrete Monte-Carlo algorithm
  Renate Dohmen
  Lecture Notes in Computer Science 854, 1994, pp. 473-484
• Experience with the implementation of a concurrent graph reduction system on an nCUBE/2 platform
  Torsten Bülck, Achim Held, Werner Kluge, Stefan Pantke, Carsten Rathsack, Sven-Bodo Scholz, Raimund Schröder
  Lecture Notes in Computer Science 854, 1994, pp. 497-508
• Automatic spark strategies and granularity for a parallel functional language reducer
  Kevin Hammond, Jim S., Jr. Mattson, Simon L. Peyton Jones
  Lecture Notes in Computer Science 854, 1994, pp. 521-532
• Self-timed communication strategies for massively parallel systolic architectures
  R.S. Hogg, D.W. Lloyd, W.I. Hughes
  Lecture Notes in Computer Science 854, 1994, pp. 557-567
• Distributed Linda tuplespace algorithms and implementations
  M.D. Feng, Y.Q. Gao, C.K. Yuen
  Lecture Notes in Computer Science 854, 1994, pp. 581-592
• Supporting coarse and fine grain parallelism in an extension of ML
  Peter Bailey, Macolm Newey, David Sitsky, Robin Stanton
  Lecture Notes in Computer Science 854, 1994, pp. 593-604
• Towards mixed computation/communication in parallel scientific libraries
  C. Calvin, L. Colombet, F. Desprez, B. Jargot, P. Michallon, B. Tourancheau, D. Trystram
  Lecture Notes in Computer Science 854, 1994, pp. 605-615
• Composing functional unit blocks for efficient interpretation of MIMD code sequences on SIMD processors
  Ross A. Bagley, Philip A. Wilsey, Nael B. Abu-Ghazaleh
  Lecture Notes in Computer Science 854, 1994, pp. 616-627
• A framework for resource-constrained rate-optimal software pipelining
  R. Govindarajan, Erik R. Altman, Guang R. Gao
  Lecture Notes in Computer Science 854, 1994, pp. 640-651
• Design of a meta-parallelizer for large scientific applications
  Jean-Yves Berthou
  Lecture Notes in Computer Science 854, 1994, pp. 652-663
• A software architecture for multidisciplinary applications: Integrating task and data parallelism
  Barbara Chapman, Piyush Mehrotra, John Van Rosendale, Hans Zima
  Lecture Notes in Computer Science 854, 1994, pp. 664-676
• On scanning space-time mapped while loops
  Martin Griebl, Christian Lengauer
  Lecture Notes in Computer Science 854, 1994, pp. 677-688
• Optimal tile sizing
  Rumen Andonov, Sanjay Rajopadhye
  Lecture Notes in Computer Science 854, 1994, pp. 701-712