T. Conte, S. Sathaye, and S. Banerjia. A persistent rescheduled-page cache for low-overhead object code compatibility. In Proc. of the 29th Symposium on Microarchitecture, pages 4--13, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Properties of Rescheduling Size Invariance for Dynamic.. - Conte, Sathaye Self-citation (Conte Sathaye) (Correct)
....pages to the text swap area, and, 3) the amount of disk space used to store the translated pages. Further discussion of the overhead introduced by DR and an investigation of tradeoffs involved in the design of the text swap used to reduce the overhead are beyond the scope of this paper (see [16] for more details) 3.1 Insertion and deletions of NOPs When the compiler schedules code for a VLIW, independent Ops which can start execution in the same machine cycle are grouped together to form a single MultiOp; each Op in a MultiOp is bound to execute on a specific functional unit. Often, ....
T. M. Conte, S. W. Sathaye, and S. Banerjia, "A Persistent Rescheduled--Page Cache for low-overhead object-code compatibility in VLIW architectures," in Proc. 29th Ann. Int'l Symp. on Microarchitecture [35]. 19
Optimization of VLIW Compatibility Systems Employing.. - Thomas Conte Sumedh Self-citation (Conte Sathaye) (Correct)
....Due to this, their rescheduling overhead is higher relative to their total execution time. Such programs are called high overhead programs. Caching of translated pages across multiple invocations of the program to reduce the rescheduling overhead, using a persistent rescheduled page cache (PRC) [1] is discussed. It was found that for the workload used in this evaluation, a PRC of size between 512 to 1024 pages, and which uses an overhead based page replacement policy would be effective in reducing the overhead. Keywords VLIW, Object Code Compatibility, Dynamic Rescheduling, ....
....available in modern operating systems, which directly helps amortize the overhead of rescheduling over the first time page accesses. The penalty of rescheduling is therefore not incurred for every page access made during the life span of the program. The Persistent rescheduled page cache (PRC) [1] demonstrates the effectiveness of this approach. Use of the PRC is discussed in detail in Section V C. D. The Dynamic rescheduling algorithm This section describes the core of the dynamic rescheduling algorithm. It is adapted from a simulation algorithm for out of order execution processors, ....
[Article contains additional citation context not shown here]
T. M. Conte, S. W. Sathaye, and S. Banerjia, "A Persistent Rescheduled--Page Cache for low-overhead object-code compatibility in VLIW architectures," in Proc. 29th Ann. Int'l Symp. on Microarchitecture, (Paris, France), Dec. 1996.
Characterizing Inter-Execution and Inter-Application.. - Hazelwood, Smith (2003) (1 citation) (Correct)
No context found.
T. Conte, S. Sathaye, and S. Banerjia. A persistent rescheduled-page cache for low-overhead object code compatibility. In Proc. of the 29th Symposium on Microarchitecture, pages 4--13, 1996.
Characterizing Inter-Execution and Inter-Application.. - Hazelwood, Smith (2003) (1 citation) (Correct)
No context found.
T. Conte, S. Sathaye, and S. Banerjia. A persistent rescheduled-page cache for low-overhead object code compatibility. In Proc. of the 29th Symposium on Microarchitecture, pages 4--13, 1996.
Data References for: "Branch Effect Reduction Techniques" - Uht, Sindagi, al. (1997) (Correct)
No context found.
T. M. Conte, S. W. Sathaye, and S. Banerjia, "A Persistent Rescheduled-Page Cache for Low Overhead Object Code Compatibility in VLIW Architectures," in Proceedings of the 29th International Symposium on Microarchitecture (MICRO-29), pp. 4--13, IEEE and ACM, December 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC