Monitors: an operating system structuring concept
Communications of the ACM
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
Packet switching in banyan networks
ISCA '79 Proceedings of the 6th annual symposium on Computer architecture
The architecture and system method of DDM1: A recursively structured Data Driven Machine
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
The incremental garbage collection of processes
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Deleting Irrelevant Tasks in an Expression-Oriented Multiprocessor System
ACM Transactions on Programming Languages and Systems (TOPLAS)
If-then-else as a concurrency inhibitor in eager beaver evaluation of recursive programs
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
| Hi-index | 0.00 |
Applicative programming Languages provide opportunities for parallel processing without requiring the programmer to be concerned with explicit synchronization of portions of the computation. We present a computational model of a multiprocessor which executes applicative programs, and we analyze the expected performance of the model via simulation. As the number of processors is doubled, elapsed execution time is nearly halved, until system bottlenecks occur. An alternative model is proposed which alleviates these bottlenecks. The basis of the second model is an interconnection switch which is characterized by log(n) access time and n log(n) cost.