Shin-Yuan Tzou and David P. Anderson and G. Scott Graham

EECS Department, University of California, Berkeley

Technical Report No. UCB/CSD-87-385

, 1987

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1987/CSD-87-385.pdf

The DASH research project is addressing the general problem of achieving high-performance network communication in large-scale distributed systems. The efficiency of moving a large amount of data between virtual address spaces (both user and kernel) on a single machine is a major component of this problem. Virtual memory (VM) remapping, as opposed to memory copying, is an attractive approach to moving data. However, remapping in shared-memory multiprocessors can be costly due to the problem of translation lookaside buffer (TLB) inconsistency. <p>This paper describes the design of the DASH mechanism for moving data between virtual address spaces. This design integrates interprocess communication (IPC), virtual memory, and process scheduling mechanisms. By adopting a particular choice of IPC semantics based on a protected shared memory model, we are able to eliminate many of the overheads that would otherwise arise from VM remapping in shared-memory multiprocessors. Put simply, we reduce the need for synchronous unmapping and, when it is necessary, we do it efficiently.

---

BibTeX citation:

@techreport{Tzou:CSD-87-385,
    Author= {Tzou, Shin-Yuan and Anderson, David P. and Graham, G. Scott},
    Title= {Efficient Local Data Movement in Shared-Memory Multiprocessor Systems},
    Year= {1987},
    Month= {Dec},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1987/6217.html},
    Number= {UCB/CSD-87-385},
    Abstract= {The DASH research project is addressing the general problem of achieving high-performance network communication in large-scale distributed systems. The efficiency of moving a large amount of data between virtual address spaces (both user and kernel) on a single machine is a major component of this problem. Virtual memory (VM) remapping, as opposed to memory copying, is an attractive approach to moving data. However, remapping in shared-memory multiprocessors can be costly due to the problem of translation lookaside buffer (TLB) inconsistency.   <p>This paper describes the design of the DASH mechanism for moving data between virtual address spaces. This design integrates interprocess communication (IPC), virtual memory, and process scheduling mechanisms. By adopting a particular choice of IPC semantics based on a protected shared memory model, we are able to eliminate many of the overheads that would otherwise arise from VM remapping in shared-memory multiprocessors. Put simply, we reduce the need for synchronous unmapping and, when it is necessary, we do it efficiently.},
}

EndNote citation:

%0 Report
%A Tzou, Shin-Yuan 
%A Anderson, David P. 
%A Graham, G. Scott 
%T Efficient Local Data Movement in Shared-Memory Multiprocessor Systems
%I EECS Department, University of California, Berkeley
%D 1987
%@ UCB/CSD-87-385
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1987/6217.html
%F Tzou:CSD-87-385