PARLE '91. Parallel Architectures and Languages Europe de Emile H.L. Aarts

PARLE '91. Parallel Architectures and Languages Europe: Volume I: Parallel Architectures and Algorithms. Eindhoven, The Netherlands, June 10-13, 1991. Proceedings: Lecture Notes in Computer Science, cartea 505

Emile H.L. Aarts

Jan van Leeuwen

Martin Rem

en Limba Engleză Paperback – 27 mai 1991

The innovative progress in the development of large- and small-scale parallel computing systems and their increasing availability have caused a sharp rise in interest in the scientific principles that underlie parallel computation and parallel programming. The biannual Parallel Architectures and Languages Europe (PARLE) conferences aim at presenting current research on all aspects of the theory, design and application of parallel computing systems and parallel processing. PARLE '91, the third conference in the series, again offers a wealth of high-quality research material for the benefit of the scientific community. Compared to its predecessors, the scope of PARLE '91 has been broadened so as to cover the area of parallel algorithms and complexity, in addition to the central themes of parallel architectures and languages. The two-volume proceedings of the PARLE '91 conference contain the text of all contributed papers that were selected for the programme and of the invited papers by leading experts in the field.

Citește tot Restrânge

	Preț	Express
Paperback (2)	333^.51 lei 6-8 săpt.
Springer Berlin, Heidelberg – 28 mai 1991	333^.51 lei 6-8 săpt.
Springer – 27 mai 1991	535^.48 lei 38-44 zile

Preț

Express

Paperback (2)

333^.51 lei 6-8 săpt.

Springer Berlin, Heidelberg – 28 mai 1991

333^.51 lei 6-8 săpt.

Springer – 27 mai 1991

535^.48 lei 38-44 zile

Din seria Lecture Notes in Computer Science

20%

Preț: 741^.34 lei
20%

Preț: 340^.22 lei
20%

Preț: 343^.43 lei
20%

Preț: 315^.18 lei
20%

Preț: 327^.41 lei
20%

Preț: 1031^.06 lei
20%

Preț: 438^.67 lei
20%

Preț: 315^.76 lei
20%

Preț: 330^.61 lei
20%

Preț: 148^.66 lei
20%

Preț: 122^.89 lei
20%

Preț: 995^.03 lei
20%

Preț: 562^.71 lei
20%

Preț: 237^.99 lei
20%

Preț: 504^.57 lei
20%

Preț: 332^.20 lei
15%

Preț: 563^.85 lei
20%

Preț: 636^.26 lei
5%

Preț: 365^.59 lei
20%

Preț: 321^.95 lei
20%

Preț: 310^.26 lei
20%

Preț: 607^.38 lei
Preț: 370^.38 lei
20%

Preț: 172^.68 lei
20%

Preț: 315^.76 lei
20%

Preț: 662^.78 lei
20%

Preț: 256^.26 lei
20%

Preț: 440^.36 lei
20%

Preț: 626^.79 lei
20%

Preț: 566^.70 lei
17%

Preț: 360^.19 lei
20%

Preț: 309^.90 lei
20%

Preț: 579^.38 lei
20%

Preț: 301^.94 lei
20%

Preț: 307^.71 lei
20%

Preț: 369^.12 lei
20%

Preț: 330^.61 lei
20%

Preț: 1044^.38 lei
20%

Preț: 574^.58 lei
Preț: 399^.17 lei
20%

Preț: 802^.24 lei
20%

Preț: 569^.11 lei
20%

Preț: 1374^.12 lei
20%

Preț: 333^.84 lei
20%

Preț: 538^.29 lei
20%

Preț: 326^.97 lei

Cuprins

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.