Wormhole routing has emerged as the most widely used switching technique in massively
parallel computers. We present a detailed survey of various techniques for enhancing the …

The performance of most digital systems today is limited by their communication or
interconnection, not by their logic or memory. As designers strive to make more efficient use …

The space of job schedulers for parallel supercomputers is rather fragmented, because
different researchers tend to make different assumptions about the goals of the scheduler …

Load Balancing in Parallel Computers: Theory and Practice is about the essential software
technique of load balancing in distributed memory message-passing parallel computers …

This paper addresses the problem of designing scalable concurrent priority queues for large
scale multiprocessors machines with up to several hundred processors. Priority queues are …

Scheduling in the context of parallel systems is often thought of in terms of assigning tasks in
a program to processors, so as to minimize the makespan. This formulation assumes that the …

Abstract The Cornell Theory Center (CTC) put a 512-node IBM SP2 system into production
in early 1995, and extended traces of batch jobs began to be collected in June of that year …

Content distribution networks (CDNs) are the most promising new techniques for co** with
the huge and swiftly growing volume of Internet traffic. In essence, CDNs are groups of proxy …

Fast execution of functions is an inevitable challenge in the serverless computing
landscape. Inefficient dispatching, fluctuations in invocation rates, burstiness of workloads …

The authors use timing experiments on the IBM SP2 to develop an overhead-quantifying
method for evaluating communication performance on message-passing multicomputers …