A persistent rescheduled-page cache for low overhead object code compatibility in VLIW architectures

Authors:
Thomas M. Conte;Sumedh W. Sathaye;Sanjeev Banerjia
Affiliations:
Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, North Carolina;Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, North Carolina;Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, North Carolina
Venue:
Proceedings of the 29th annual ACM/IEEE international symposium on Microarchitecture
Year:
1996

Citing 16
Cited 2

Andrew: a distributed personal computing environment

Communications of the ACM - The MIT Press scientific computation series
The design of the UNIX operating system

The design of the UNIX operating system
Mimic: a fast system/370 simulator

SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Caching in the Sprite network file system

ACM Transactions on Computer Systems (TOCS)
Hardware support for large atomic units in dynamically scheduled machines

MICRO 21 Proceedings of the 21st annual workshop on Microprogramming and microarchitecture
MIPS RISC architectures

MIPS RISC architectures
An architectural framework for migration from CISC to higher performance platforms

ICS '92 Proceedings of the 6th international conference on Supercomputing
Effective compiler support for predicated execution using the hyperblock

MICRO 25 Proceedings of the 25th annual international symposium on Microarchitecture
Binary translation

Communications of the ACM
IBM Power and PowerPC

IBM Power and PowerPC
A fill-unit approach to multiple instruction issue

MICRO 27 Proceedings of the 27th annual international symposium on Microarchitecture
Dynamic rescheduling: a technique for object code compatibility in VLIW architectures

Proceedings of the 28th annual international symposium on Microarchitecture
Dynamically scheduled VLIW processors

MICRO 26 Proceedings of the 26th annual international symposium on Microarchitecture
An Architectural Framework for Supporting Heterogeneous Instruction-Set Architectures

Computer
Architecture of the Pentium Microprocessor

IEEE Micro
Tuning the Pentium Pro Microarchitecture

IEEE Micro

An out-of-order execution technique for runtime binary translators

Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Properties of Rescheduling Size Invariance for Dynamic Rescheduling-Based VLIW Cross-Generation Compatibility

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Object-code compatibility between processor generations is an open issue for VLIW architectures. A potential solution is a technique termed dynamic rescheduling, which performs run-time software rescheduling at the first-time page faults. The time required for rescheduling the pages constitutes a large portion of the overhead of this method. A disk caching scheme that uses a persistent rescheduled-page cache (PRC) is presented. The scheme reduces the overhead associated with dynamic rescheduling by saving rescheduled pages on disk, across program executions. Operating system support is required for dynamic rescheduling and management of the PRC. The implementation details for the PRC are discussed. Results of simulations used to gauge the effectiveness of PRC indicate that: the PRC is effective in reducing the overhead of dynamic rescheduling; and due to different overhead requirements of programs, a split PRC organization performs better than a unified PRC. The unified PRC was studied for two different page replacement policies: LRU and overhead-based replacement. It was found that with LRU replacement, all the programs consistently perform better with increasing PRC sizes, but the high-overhead programs take a consistent performance hit compared to the low-overhead programs. With overhead-based replacement, the performance of high-overhead programs improves substantially, while the low-overhead programs perform only slightly worse than in the case of the LRU replacement.