Fine-grain priority scheduling on multi-channel memory systems

Proceedings - International Symposium on High-Performance Computer Architecture

Volumn 2002-January, Issue , 2002, Pages 107-116

  Zhu, Zhichun ^a   Zhang, Zhao ^a   Zhang, Xiaodong ^a  

^a The College of William and Mary   (United States)

Author keywords

Application software; Bandwidth; Computer science; Concurrent computing; Delay; Educational institutions; Processor scheduling; Random access memory; Resumes; System performance

Indexed keywords

APPLICATION PROGRAMS; BANDWIDTH; COMPUTER ARCHITECTURE; COMPUTER SCIENCE; DYNAMIC RANDOM ACCESS STORAGE; MEMORY ARCHITECTURE; RANDOM ACCESS STORAGE; SCHEDULING; SUPERCOMPUTERS;

CONCURRENT COMPUTING; DELAY; EDUCATIONAL INSTITUTIONS; PROCESSOR SCHEDULING; RANDOM ACCESS MEMORY; RESUMES; SYSTEM PERFORMANCE;

MULTITASKING;

EID: 84949752992     PISSN: 15300897     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPCA.2002.995702     Document Type: Conference Paper

References (21)

1. M. M. Annavaram, J. M. Patel, and E. S. Davidson. Data prefetching by dependence graph precomputation. In Proceedings of the 28th Annual International Symposium on Computer Architecture, pages 52-61, June 2001.
2. R. Balasubramonian, S. Dwarkadas, and D. H. Albonesi. Dynamically allocating processor resources between nearby and distant ILP. In Proceedings of the 28th Annual International Symposium on Computer Architecture, pages 26-37, June 2001.
3. D. C. Burger and T. M. Austin. The SimpleScalar Tool Set, Version 2.0. Technical Report CS-TR-1997-1342, University of Wisconsin, Madison, June 1997.
4. J. D. Collins, H. Wang, D. M. Tullsen, C. Hughes, Y.-F. Lee, D. Lavery, and J. P. Shen. Speculative precomputation: Long-range prefetching of delinquent loads. In Proceedings of the 28th Annual International Symposium on Computer Architecture, pages 14-25, June 2001.
5. V. Cuppu and B. Jacob. Concurrency, latency, or system overhead: Which has the largest impact on uniprocessor DRAM-system performance? In Proceedings of the 28th Annual International Symposium on Computer Architecture, pages 62-71, June 2001.
6. K. I. Farkas, P. Chow, N. P. Jouppi, and Z. Vranesic. Memory-system design considerations for dynamically-scheduled processors. In Proceedings of the 24th Annual International Symposium on Computer Architecture, pages 133-143, June 1997.
7. S. I. Hong, S. A. McKee, M. H. Salinas, R. H. Klenke, J. H. Aylor, and W. A. Wulf. Access order and effective bandwidth for streams on a Direct Rambus memory. In Proceedings of the Fifth International Symposium on High-Performance Computer Architecture, pages 80-89, Jan.1999.
8. W. F. Lin, S. Reinhardt, and D. Burger. Reducing DRAM latencies with an integrated memory hierarchy design. In Proceedings of the Seventh International Symposium on High Performance Computer Architecture, pages 301-312, Jan. 2001.
9. C.-K. Luk. Tolerating memory latency through software-controlled pre-execution in simultaneous multithreading processors. In Proceedings of the 28th Annual International Symposium on Computer Architecture, pages 40-51, June 2001.
10. B. K. Mathew, S. A. McKee, J. B. Carter, and A. Davis. Design of a parallel vector access unit for SDRAM memory systems. In Proceedings of the Sixth International Symposium on High-Performance Computer Architecture, pages 39-48, Jan. 2000.
11. S. A. McKee and W. A. Wulf. Access ordering and memory-conscious cache utilization. In Proceedings of the First International Symposium on High-Performance Computer Architecture, pages 253-262, Jan. 1995.
12. S. A. Moyer. Access Ordering and Effective Memory Bandwidth. PhD thesis, University of Virginia, Department of Computer Science, Apr. 1993. Also as TR CS-93-18.
13. Rambus Inc. 256/288-Mbit Direct RDRAM (32 Split Bank Architecture), 2000. http://www.rambus.com.
14. S. Rixner, W. J. Dally, U. J. Kapasi, B. Khailany, A. López-Lagunas, P. R. Mattson, and J. D. Owens. A bandwidth-efficient architecture for media processing. In Proceedings of the 31st Annual ACM/IEEE International Symposium on Microarchitecture, pages 3-13, Nov. 1998.
15. S. Rixner, W. J. Dally, U. J. Kapasi, P. Mattson, and J. D. Owens. Memory access scheduling. In Proceedings of the 27th Annual International Symposium on Computer Architecture, pages 128-138, June 2000.
16. S. P. Song, M. Denman, and J. Chang. The PowerPC-604 RISC microprocessor. IEEE Micro, 14(5):8-17, Oct. 1994.
17. S. P. Vanderwiel and D. J. Lilja. Data prefetch mechanisms. ACM Computing Surveys, 32(2):174-199, June 2000.
18. C. Weaver. http://www.simplescalar.org. SPEC2000 binaries.
19. K. C. Yeager. The MIPS R10000 superscalar microprocessor: Emphasizing concurrency and latency-hiding techniques to efficiently run large, real-world applications. IEEE Micro, 16(2):28-40, Apr. 1996.
20. Z. Zhang, Z. Zhu, and X. Zhang. A permutation-based page interleaving scheme to reduce row-buffer conflicts and exploit data locality. In Proceedings of the 33rd Annual IEEE/ACM International Symposium on Microarchitecture, pages 32-41, Dec. 2000.
21. C. Zilles and G. Sohi. Execution-based prediction using speculative slices. In Proceedings of the 28th Annual International Symposium on Computer Architecture, pages 2-13, June 2001.