ACM Home Page
Please provide us with feedback. Feedback
Options for dynamic address translation in COMAs
Full text PdfPdf (1.37 MB)
Source International Symposium on Computer Architecture archive
Proceedings of the 25th annual international symposium on Computer architecture table of contents
Barcelona, Spain
Pages: 214 - 225  
Year of Publication: 1998
ISBN:0-8186-8491-7
Also published in ...
Authors
Xiaogang Qiu  Department of Electrical Engineering - Systems, University of Southern California, Los Angeles, CA
Michel Dubois  Department of Electrical Engineering - Systems, University of Southern California, Los Angeles, CA
Sponsors
IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

In modern processors, the dynamic translation of virtual addresses to support virtual memory is done before or in parallel with the first-level cache access. As processor technology improves at a rapid pace and the working sets of new applications grow insatiably the latency and bandwidth demands on the TLB (Translation Lookaside Buffer) are getting more and more difficult to meet. The situation is worse in multiprocessor systems, which run larger applications and are plagued by the TLB consistency problem.We evaluate and compare five options for virtual address translation in the context of COMAs (Cache Only Memory Architectures). The dynamic address translation mechanism can be located after the cache access provided the cache is virtual. In a particular design, which we call V-COMA for Virtual COMA, the physical address concept and the traditional TLB are eliminated. While still supporting virtual memory, V-COMA reduces the address translation overhead to a minimum.V-COMA scales well and works better in systems with large number of processors. As a machine running on virtual addresses, V-COMA provides a simple and consistent hardware model to the operating system and the compiler, in which further optimization opportunities are possible.


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
2
3
 
4
H. Burkhardt III et al. "Overview of the KSR-1 Computer System," Technical Report KSR-TR-9202001, Kendall Square Research, Feb. 1992.
 
5
 
6
7
8
9
10
11
 
12
L. Gwennap, "Design Concepts for Merced, Forecasting the Inner Workings of the Decade's Most Anticipated Processor," pages 9-11, Microprocessor Report, vol. 11, no. 3, March I0, 1997.
 
13
14
 
15
 
16
17
18
 
19
William Lynch. "The Interaction of Virtual Memory and Cache Memory," Ph.D. Thesis, Technical Report CSL-TR-93- 587, Stanford University, 1993.
 
20
 
21
22
 
23
Xiaogang Qiu and Michel Dubois, "Options for Dynamic Address Translation in COMAs", Technical report CENG98-08, Department of Electrical Engineering- Systems, University of Southern California.
24
25
26
 
27
Patricia Teller and Allan Gottlieb. "Locating Multiprocessor TLBs at Memory," In Proceedings of the 27th Annual Hawaii international Conference on System Science, pages 554-563, 1994.
 
28
29
30
31
32
 
33


Collaborative Colleagues:
Xiaogang Qiu: colleagues
Michel Dubois: colleagues