Reducing I/O complexity by simulating coarse grained parallel algorithms

Proceedings of the International Parallel Processing Symposium, IPPS

Volumn , Issue , 1999, Pages 14-20

  Dehne, Frank ^a   Hutchinson, David ^a   Maheshwari, Anil ^a   Dittrich, Wolfgang ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; COMPUTER SYSTEMS PROGRAMMING; DATA ACQUISITION; DATA STORAGE EQUIPMENT; INPUT OUTPUT PROGRAMS; PARALLEL PROCESSING SYSTEMS; SORTING; TELECOMMUNICATION NETWORKS;

COARSE GRAINED MULTICOMPUTER (CGM) ALGORITHMS; EXTERNAL MEMORY (EM) ALGORITHMS; PARALLEL DISK MODELS;

PARALLEL ALGORITHMS;

EID: 0032667093     PISSN: 10637133     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (29)