Buch, Englisch, Band 505, 427 Seiten, Book, Format (B × H): 155 mm x 235 mm, Gewicht: 1380 g
Volume I: Parallel Architectures and Algorithms. Eindhoven, The Netherlands, June 10-13, 1991. Proceedings
Buch, Englisch, Band 505, 427 Seiten, Book, Format (B × H): 155 mm x 235 mm, Gewicht: 1380 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-54151-6
Verlag: Springer Berlin Heidelberg
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Funktionale, Logische, Parallele und Visuelle Programmierung
- Mathematik | Informatik EDV | Informatik Technische Informatik Hochleistungsrechnen, Supercomputer
- Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Betriebssysteme Windows Betriebssysteme
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik EDV | Informatik Technische Informatik Systemverwaltung & Management
- Mathematik | Informatik EDV | Informatik Technische Informatik Externe Speicher & Peripheriegeräte
Weitere Infos & Material
Parallel evaluation of functional programs: The ??, G?-machine approach.- Towards a single model of efficient computation in real parallel machines.- Neural computing and the GALATEA project.- A novel high-speed memory organization for fine-grain multi-thread computing.- Evaluation of Futurebus hierarchical caching.- Efficient global computations on a processor network with programmable logic.- POMP or how to design a massively parallel machine with small developments.- The function processor: An architecture for efficient execution of recursive functions.- The G-line a distributed processor for graph reduction.- The derivation of distributed termination detection algorithms from garbage collection schemes.- Indirect reference counting: A distributed garbage collection algorithm.- Periodic multiprocessor scheduling.- Embeddings of shuffle-like graphs in hypercubes.- Mapping uniform recurrences onto small size arrays.- Area complexity of multilective merging.- Deriving fully efficient systolic arrays by quasi-linear allocation functions.- Affine timings for systems of affine recurrence equations.- On the computational complexity of optimal sorting network verification.- Managing a parallel heap efficiently.- Parallel complexity in the design and analysis of concurrent systems.- FORK a high-level language for PRAMs.- Neural network-based decision making for large incomplete databases.- An optical content-addressable parallel processor for fast searching and retrieving.- Towards an efficient hybrid dataflow architecture model.- Data flow implementation of generalized guarded commands.- On the design of deadlock-free adaptive routing algorithms for multicomputers: Design methodologies.- A toolkit for debugging parallel Lisp programs.