Communications of the ACM - Special section on computer architecture
Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
Computer
Architecture of a message-driven processor
ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Communicating sequential processes
Communications of the ACM
A VLSI Architecture for Concurrent Data Structures
A VLSI Architecture for Concurrent Data Structures
Introduction to VLSI Systems
VLSI Mesh Routing Systems
Object-oriented concurrent programming in CST
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Optimal matrix algorithms on homogeneous hypercubes
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Object-oriented concurrent programming in CST
OOPSLA/ECOOP '88 Proceedings of the 1988 ACM SIGPLAN workshop on Object-based concurrent programming
Technologies for low latency interconnection switches
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Experience with CST: programming and implementation
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
“Topologies”—distributed objects on multicomputers
ACM Transactions on Computer Systems (TOCS)
The turn model for adaptive routing
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Dynamically-Allocated Multi-Queue Buffers for VLSI Communication Switches
IEEE Transactions on Computers
Fast deflection routing for packets and worms
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Optimal fully adaptive wormhole routing for meshes
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
The turn model for adaptive routing
Journal of the ACM (JACM)
A Parallel Virtual Machine for Programs Composed of Abstract Data Types
IEEE Transactions on Computers
Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks
IEEE Transactions on Computers
Adaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes
IEEE Transactions on Computers
A Theory of Wormhole Routing in Parallel Computers
IEEE Transactions on Computers
The turn model for adaptive routing
25 years of the international symposia on Computer architecture (selected papers)
Symmetric Crossbar Arbiters for VLSI Communication Switches
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
The Message Flow Model for Routing in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
A foundation for designing deadlock-free routing algorithms in wormhole networks
Journal of the ACM (JACM)
Off-chip communication architectures for high throughput network processors
Computer Communications
| Hi-index | 0.01 |
Fine-grain concurrent computers, by operating at a fine grain, increase the amount of concurrency that can be efficiently exploited in a given problem. Programming is simplified because programs may be partitioned into natural units of methods and objects and these objects are addressed uniformly whether they are local or remote. The construction of these machines poses challenging problems in reducing overhead, increasing communication bandwidth, and developing resource management techniques. This paper describes this class of machines, the challenges posed by their construction, and recent progress toward meeting these challenges.