Results 1 
2 of
2
Global Optimizations for Parallelism and Locality on Scalable Parallel Machines
 IN PROCEEDINGS OF THE SIGPLAN '93 CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION
, 1993
"... Data locality is critical to achieving high performance on largescale parallel machines. Nonlocal data accesses result in communication that can greatly impact performance. Thus the mapping, or decomposition, of the computation and data onto the processors of a scalable parallel machine is a key i ..."
Abstract

Cited by 247 (21 self)
 Add to MetaCart
Data locality is critical to achieving high performance on largescale parallel machines. Nonlocal data accesses result in communication that can greatly impact performance. Thus the mapping, or decomposition, of the computation and data onto the processors of a scalable parallel machine is a key issue in compiling programs for these architectures.
Distributed Paging for General Networks
, 1996
"... Distributed paging [BFR92, ABF93b, AK95] deals with the dynamic allocation of copies of files in a distributed network as to minimize the total communication cost over a sequence of read and write requests. Most previous work deals with the file allocation problem [BS89, West91, CLRW93, ABF93a, ..."
Abstract

Cited by 59 (5 self)
 Add to MetaCart
Distributed paging [BFR92, ABF93b, AK95] deals with the dynamic allocation of copies of files in a distributed network as to minimize the total communication cost over a sequence of read and write requests. Most previous work deals with the file allocation problem [BS89, West91, CLRW93, ABF93a, WY93, Koga93, AK94, LRWY94] where infinite nodal memory capacity is assumed. In contrast the distributed paging problem makes the more realistic assumption that nodal memory capacity is limited. Former work on distributed paging deals with the problem only in the case of a uniform network topology. This paper gives the first distributed paging algorithm for general networks. The algorithm is competitive in storage and communication. The competitive ratios are polylogarithmic in the total number of network nodes and the diameter of the network. Johns Hopkins University and Lab. for Computer Science, MIT. Supported by Air Force Contract TNDGAFOSR860078, ARO contract DAAL0386K0171, NSF contract 9114440CCR, DARPA contract N00014J 921799, and a special grant from IBM. EMail: baruch@theory.lcs.mit.edu. y Department of Computer Science, School of Mathematics, TelAviv University, TelAviv 69978, Israel. Supported by a grant from the Israeli Academy of Sciences. Email: yairb@math.tau.ac.il, fiat@math.tau.ac.il 0 1