Titlebook: Parle ’91 Parallel Architectures and Languages Europe; Volume I: Parallel A Emile H. L. Aarts,Jan Leeuwen,Martin Rem Conference proceedings

affidavit

書目名稱Parle ’91 Parallel Architectures and Languages Europe影響因子(影響力)




書目名稱Parle ’91 Parallel Architectures and Languages Europe影響因子(影響力)學科排名




書目名稱Parle ’91 Parallel Architectures and Languages Europe網(wǎng)絡(luò)公開度




書目名稱Parle ’91 Parallel Architectures and Languages Europe網(wǎng)絡(luò)公開度學科排名




書目名稱Parle ’91 Parallel Architectures and Languages Europe被引頻次




書目名稱Parle ’91 Parallel Architectures and Languages Europe被引頻次學科排名




書目名稱Parle ’91 Parallel Architectures and Languages Europe年度引用




書目名稱Parle ’91 Parallel Architectures and Languages Europe年度引用學科排名




書目名稱Parle ’91 Parallel Architectures and Languages Europe讀者反饋




書目名稱Parle ’91 Parallel Architectures and Languages Europe讀者反饋學科排名

LIMN

invert

VAN

Jan Korst,Emile Aarts,Jan Karel Lenstra,Jaap Wessels sind. Der Verlag stellt mit diesem Archiv Quellen für die historische wie auch die disziplingeschichtliche Forschung zur Verfügung, die jeweils im historischen Kontext betrachtet werden müssen. Dieser Titel erschien in der Zeit vor 1945 und wird daher in seiner zeittypischen politisch-ideologischen Ausrichtung vom Verlag nicht beworben.

高度表

前奏曲

The G-Line a Distributed Processor for Graph Reductionerform construction of a subgraph in a single parallel access to the graph memory. With a simulation, using infinite hardware, we have shown that the architecture performs well. We argue that a realistic implementation is possible.

Pillory

不來

Parallel Evaluation of Functional Programs: The 〈,〉-machine approach (Summary)For a number of years this author, together with Lennart Augustsson, have been developing fast implementations of lazy functional languages, based on graph reduction, for ordinary (sequential) computers. Our approach can be summarised very briefly as follows.

不可侵犯

Periodic Multiprocessor SchedulingA number of scheduling and assignment problems are presented involving the execution of periodic operations in a multiprocessor environment. We consider the computational complexity of these problems and propose approximation algorithms for operations with identical periods as well as for operations with arbitrary integer periods.

Infant