Size-based scheduling policies, such as shortest remaining processing time (SRPT), have
been studied since the 1960s and have been applied in various areas, including packet …

Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean
response time, in recent years many computer systems have used the heuristic of" favoring …

Scheduling is a fundamental technique for improving performance in computer systems.
From web servers to routers to operating systems, how the bottleneck device is scheduled …

Load balancing is a common approach for task assignment in distributed architectures. In
this paper, we show that the degree of inefficiency in load balancing designs is highly …

This research examines correlated parallel machine scheduling problems since they better
reflect real world manufacturing environments. We consider the problem of scheduling …

Peer-to-peer systems have grown significantly in popularity over the last few years. An
increasing number of research projects have been closely following this trend, looking at …

Scheduling policies that favor small jobs have received growing attention due to their
superior performance with respect to mean delay, eg, Shortest Remaining Processing Time …

It is known that foreground-background processor sharing (FBPS) stochastically minimizes
the number in the system with a single server when task processing times follow a …

This paper proposes an enhanced Branch and Bound (B&B) algorithm for Network-on-Chip
(NoC) task mapping. The novelty of the algorithm can be summarized in two aspects. First, a …

We show how to significantly improve the mean response time seen by both uploaders and
downloaders in peer-to-peer data-sharing systems. Our work is motivated by the observation …