ACM Home Page
Please provide us with feedback. Feedback
Page table management in local/remote architectures
Full text PdfPdf (783 KB)
Source International Conference on Supercomputing archive
Proceedings of the 2nd international conference on Supercomputing table of contents
St. Malo, France
Pages: 1 - 8  
Year of Publication: 1988
ISBN:0-89791-272-1
Author
M. A. Holliday  Duke Univ., Durham, NC
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 26,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/55364.55365
What is a DOI?

ABSTRACT

We conjecture that a paged memory with page migration by the operating system may be an effective system environment for a local/remote shared memory architecture executing a single parallel computation. Implementing a paged memory in such an architecture raises several issues with respect to page table management. These issues include page table placement, page table replication level, and page table storage overhead. We discuss these issues, propose alternative solutions, and present an experimental evaluation of the solutions. The experiments were conducted using software implemented page tables on a 32-node BBN Butterfly. The experiments have investigated the case of a single shared-memory parallel computation with one user process per processor. The implementation captures the costs of page table entry locking and reference information updating. Each user process has a copy of the computation's code and non-shared variables in local memory. Only shared data references use the page tables. A separate processor has a migration daemon that periodically unblocks itself and examines the page tables to make policy decisions concerning page migration. The conclusions drawn include that: 1) a fully replicated page-indexed page table significantly reduces network, memory, and lock contention in comparison to a single copy, 2) a fully replicated page-indexed page table faces a severe memory utilization problem in large-scale architectures, 3) a proposed approach based on inverted page tables appears to be a promising alternative to a fully replicated page-indexed page table.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BBN. Butterfly Parallel Processor Overview. Bolt Beranek and Newman Adv. Computers Inc., Cambridge, MA, June 1985.
2
 
3
M.D. Hill etal. Spur: a vlsi multiproeessor workstation. IEEE Computer, November 1985.
 
4
D. C~jskl, D. Kuck, D. Lawrie, and A. Sarneh. Cedar--a large scale multiprocessor. In Proceedings of the 1983 International Conference on Parallel Processing, pages 524- 529, August 1983.
5
 
6
 
7
G. Pfister, W. Brentley, D. George, S. Harvey, W. Kleinfelder, K. McAuliffe, E. Melton, V. Norton, and J. Weiss. The IBM research parallel processor prototype (RPJ): introduction and architecture. In Proceedings of the 1985 international Conference on Parallel Processing, August 1985.
8
 
9
Sequent Computer Systems, Inc. Balance 8000 Technical Summary. Sequent Computer SysterrL~, Inc., 1986.
10
 
11
A.J. Smith. A modified working set paging algorithm. IEEE Transactions on Computers, C-25(9):907- 914, September 1976.
 
12
13

CITED BY  8