Title :
Latency hiding in message-passing architectures
Author :
Bruening, U. ; Giloi, W.K. ; Schroeder-Preikschat, W.
Author_Institution :
GMD Inst. for Comput. Archit. and Software Technol., Berlin, Germany
Abstract :
The paper demonstrates the advantages of having two processors in the node of a distributed memory architecture, one for computation and one for communication. The architecture of such a dual-processor node is discussed. To exploit fully the potential for parallel execution of computation threads and communication threads, a novel, compiler-optimized IPC mechanism allows for an unbuffered no-wait send and a prefetched receive without the danger of semantics violation. It is shown how an optimized parallel operating system can be constructed such that the application processor´s involvement in communication is kept to a minimum while the utilization of both processors is maximized. The MANNA implementation results in an effective message start-up latency of only 1...4 microseconds. It is also shown how the dual-processor node is utilized to efficiently realize virtual shared memory
Keywords :
distributed memory systems; message passing; multiprocessing programs; shared memory systems; virtual machines; virtual storage; MANNA; communication threads; compiler-optimized IPC mechanism; computation threads; distributed memory architecture; dual-processor node; latency hiding; message start-up latency; message-passing architectures; optimized parallel operating system; prefetched receive; semantics violation; unbuffered no-wait send; virtual shared memory; Computer architecture; Concurrent computing; Delay; Distributed computing; Memory architecture; Message passing; Operating systems; Parallel programming; Software; Yarn;
Conference_Titel :
Parallel Processing Symposium, 1994. Proceedings., Eighth International
Conference_Location :
Cancun
Print_ISBN :
0-8186-5602-6
DOI :
10.1109/IPPS.1994.288227