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	Hilfe

Suche: Series=LNCS AND YEAR=1992

• A new parallel factorization A=DD^tBC for band symmetric positive definite matrices
  Ilan Bar-On, Ophir Munk
  Lecture Notes in Computer Science 634, 1992, pp. 349-354
• Numerical performance of an asynchronous Jacobi iteration
  J.M. Bull, T.L. Freeman
  Lecture Notes in Computer Science 634, 1992, pp. 361-366
• A comparison of two memory models for high performance computers
  Peter L. Bird, Nigel P. Topham, Sathiamoorthy Manoharan
  Lecture Notes in Computer Science 634, 1992, pp. 399-404
• A large context multithreaded architecture
  R. Govindarajan, S.S. Nemawarkar
  Lecture Notes in Computer Science 634, 1992, pp. 423-428
• On the practical efficiency of randomized shared memory
  Hermann Hellwagner
  Lecture Notes in Computer Science 634, 1992, pp. 429-440
• \kappa-project / first step: To improve data manipulations and representations on parallel computers
  Hassane Essafi, Marc Pic, Didier Juvin
  Lecture Notes in Computer Science 634, 1992, pp. 503-508
• A parallel best-first B&B with synchronization phases
  Marc Gengler, Giovanni Coray
  Lecture Notes in Computer Science 634, 1992, pp. 515-526
• Improved parallel sorting of presorted sequences
  Jingsen Chen, Christos Levcopoulos
  Lecture Notes in Computer Science 634, 1992, pp. 539-544
• MIMD dictionary machines: From theory to practice
  Thibault Duboux, Afonso Ferreira, Michel Gastaldo
  Lecture Notes in Computer Science 634, 1992, pp. 545-550
• Parallel minimum spanning forest algorithms on the star and pancake interconnection networks
  Selim G. Akl, Ke Qiu
  Lecture Notes in Computer Science 634, 1992, pp. 565-570
• Parallel algorithms for the distance transformation
  Hugo Embrechts, Dirk Roose
  Lecture Notes in Computer Science 634, 1992, pp. 571-582
• Static scheduling of parallel programs for message passing architectures
  Apostolos Gerasoulis, Tao Yang
  Lecture Notes in Computer Science 634, 1992, pp. 601-612
• Scheduling loops on parallel processors: A simple algorithm with close to optimum performance
  Franco Gasperoni, Uwe Schwiegelshohn
  Lecture Notes in Computer Science 634, 1992, pp. 625-636
• Semantic analysis for parallelizing C
  Pierre David
  Lecture Notes in Computer Science 634, 1992, pp. 647-652
• Unimodularity considered non-essential
  Michael Barnett, Christian Lengauer
  Lecture Notes in Computer Science 634, 1992, pp. 659-664
• PEPSIM-ST: A simulator tool for benchmarking
  Michael M. Gutzmann, Klaus Steffan
  Lecture Notes in Computer Science 634, 1992, pp. 665-676
• Estimating the effective performance of program parallelization on shared memory MIMD multiprocessors
  Jean-Yves Berthou, Philippe Klein
  Lecture Notes in Computer Science 634, 1992, pp. 701-706
• On the simulation of pipelining of fully digit on-line floating-point adder networks on massively parallel computers
  Jean Duprat, Mario Fiallos Aguilar
  Lecture Notes in Computer Science 634, 1992, pp. 707-712
• A time-bounded binding access with low task-switching cost in an OR-parallel Prolog
  H. Bourzoufi, G. Goncalves, B. Toursel
  Lecture Notes in Computer Science 634, 1992, pp. 725-730
• A hybrid dataflow architecture with multiple tokens
  Boyan Bonchev, Miroslav Iliev
  Lecture Notes in Computer Science 634, 1992, pp. 737-742
• The construction of numerical mathematical software for the AMT DAP by program transformation
  James M. Boyle, Maurice Clint, Stephen Fitzpatrick, Terence J. Harmer
  Lecture Notes in Computer Science 634, 1992, pp. 761-767
• On using object oriented parallel programming to build distributed algebraic abstractions
  Dennis Gannon, Jenq Kuen Lee, Srinivas Narayana
  Lecture Notes in Computer Science 634, 1992, pp. 769-774
• Implementation of the self-organizing feature map on parallel computers
  V. Demian, J.-C. Mignot
  Lecture Notes in Computer Science 634, 1992, pp. 775-776
• Memory access in shared virtual memory
  Rudolf Berrendorf
  Lecture Notes in Computer Science 634, 1992, pp. 785-786
• Manifold: Concepts and implementation
  F. Arbab, I. Herman, P. Spilling
  Lecture Notes in Computer Science 634, 1992, pp. 793-794