Parallelism and locality in priority queues

IEEE Symposium on Parallel and Distributed Processing - Proceedings

Volumn , Issue , 1994, Pages 490-496

  Ranade, A ^a   Cheng, S ^a   Deprit, E ^a   Jones, J ^a   Shih, S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; COMPUTER NETWORKS; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; DATA STORAGE EQUIPMENT; DATA STRUCTURES; PARALLEL ALGORITHMS; PROBABILITY; QUEUEING THEORY; RANDOM PROCESSES;

BRUTE FORCE SIMULATION; COMMUNICATION COMPLEXITY; DIMENSIONAL ARRAY; GRAPH ALGORITHMS; LINEAR ARRAY; MAPPED SIMULATION; OPTIMAL PARALLEL IMPLEMENTATION; PARALLELISM; PRIORITY QUEUES; SEQUENTIAL COMPUTING;

PARALLEL PROCESSING SYSTEMS;

EID: 0028713359     PISSN: 10636374     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)