论文信息 - On the problem of optimizing data transfers for complex memory systems

On the problem of optimizing data transfers for complex memory systems

Parallel supercomputers architectures with complex memory hierarchies or distributed memory systems have become very common. Unfortunately, the problems associated with restructuring software to take advantage of these memory systems are not easily solved. This paper presents an overview of some of the mathematical issues behind several of these problems and attempts to give a brief look at some of the potential solutions.

[1] Gregory F. Pfister,et al. “Hot spot” contention and combining in multistage interconnection networks , 1985, IEEE Transactions on Computers.

[2] Edward G. Coffman,et al. Organizing matrices and matrix operations for paged memory systems , 1969, Commun. ACM.

[3] Constantine Demetrios Polychronopoulos. On program restructuring, scheduling, and communication for parallel processor systems , 1986 .

[4] W. ABU-SUFAH,et al. Automatic program transformations for virtual memory computers * , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[5] Robert H. Thomas,et al. Performance Measurements on a 128-Node Butterfly Parallel Processor , 1985, International Conference on Parallel Processing.

[6] William Jalby,et al. Impact of Hierarchical Memory Systems On Linear Algebra Algorithm Design , 1988 .

[7] A. C. McKellar,et al. The organization of matrices and matrix operations in a paged multiprogramming environment , 1968 .

[8] Alexander V. Veidenbaum,et al. A cache coherence scheme with fast selective invalidation , 1988, ISCA '88.

[9] Duncan H. Lawrie,et al. On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations , 1981, IEEE Transactions on Computers.