Decentralized optimal power pricing: the development of a parallel program
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Analytical performance prediction on multicomputers
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Teaching an engineering approach for network computing
SIGCSE '97 Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education
Information Retrieval on an SCI-Based PC Cluster
The Journal of Supercomputing
Decentralized Optimal Power Pricing: The Development of a Parallel Program
IEEE Parallel & Distributed Technology: Systems & Technology
Tulip: A Portable Run-Time System for Object-Parallel Systems
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Optimizing Message Delivery in Asynchronous Distributed Applications
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Analysis of communication data: compression network
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Massively parallel support for computationally effective recognition queries
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Hi-index | 0.00 |
The design challenge for large-scale multiprocessors is (1) to minimize communication overhead, (2) allow communication to overlap computation, and (3) coordinate the two without sacrificing processor cost/performance. We show that existing message passing multiprocessors have unnecessarily high communication costs. Research prototypes of messages driven machine demonstrate low communication overhead, but poor processor cost/performance. We introduce a simple communication mechanism, Active Messages, show that it is intrinsic to both architectures, allows cost effective use of the hardware, and offers tremendous flexibility. Implementations on nCUBE/2 and CM-5 are described and evaluated using a split-phase shared-memory extension to C, Split-C. We further show that active messages are sufficient to implement the dynamically scheduled languages for which message driven machines were designed. With this mechanism, latency tolerance becomes a programming/compiling concern. Hardware support for active messages