Cloud computing enables users to provision resources on demand and execute applications
in a way that meets their requirements by choosing virtual resources that fit their application …

N COMPUTER applications we are used to live with approximation. Var I ious notions of
approximation appear, in fact, in many circumstances. One notable example is the type of …

Traditionally, the study of scheduling policies has focused on performance metrics such as
response time, queue length, and throughput. However, the more vague notion of 'fairness' …

In this paper, we consider two fundamental multiprocessor scheduling problems: q on-line
multiprocessor scheduling of sequential jobs in a hard-real-time environment, in which all …

In this chapter, we summarize research e orts on several di erent problems that fall under the
rubric of online scheduling. In online scheduling, the scheduler receives jobs that arrive over …

Phase change memory (PCM) is a promising technology that can offer higher capacity than
DRAM. Unfortunately, PCM's access latency and energy are higher than DRAM's and its …

The Shortest-Remaining-Processing-Time (SRPT) scheduling policy has long been known
to be optimal for minimizing mean response time (sojourn time). Despite this fact, SRPT …

Is it possible to reduce the expected response time of every request at a web server, simply
by changing the order in which we schedule the requests? That is the question we ask in …

Commodity clusters are used routinely for deploying service hosting platforms. Due to
hardware and operation costs, clusters need to be shared among multiple services. Crucial …

The effect of spatial diversity on the throughput and reliability of wireless networks is
examined. Spatial diversity is realized through multiple independently fading …