Office and home environments are increasingly crowded with personal computers. Even though these computers see little use in the course of the day, they often remain powered, even when idle. Leaving idle PCs running is not only wasteful, but with rising energy costs it is increasingly more expensive. We propose partial migration of idle desktop sessions into the cloud to achieve energyproportio...

We consider a queueing loss system with heterogeneous skill based servers with arbitrary distributions. We assume Poisson arrivals, with each arrival having a vector indicating which of the servers are eligible to serve it. Arrivals can only be assigned to a server that is both idle and eligible. We assume arrivals are assigned to the idle eligible server that has been idle the longest and deri...

We propose an opportunistic channel access scheme for cognitive radio-enabled secondary networks. In our work, we model the channel occupancy due to Primary User (PU) activity as a 2-state Alternating Renewal Process, with alternating busy and idle periods. Once a Secondary Node (SN) senses the channel idle, the proposed scheme uses the residual idle time distribution to estimate the transmissi...

RSA Data Security, Inc. is sponsoring contests to prove the (in-)security of miscellaneous cryptographic algorithms as DES or RC5. We have joined RSA’s RC5 contest by combining idle CPU power from users visiting a web site. Via an embedded Java RC5 applet down-loading and testing RC5 keys from the web server it was originating from, visitors can participate and donate idle CPU cycles without ha...

We propose an opportunistic channel access scheme for cognitive radio-enabled secondary networks. In our work, we model the channel occupancy due to Primary User (PU) activity as a 2-state Alternating Renewal Process, with alternating busy and idle periods. Once a Secondary Node (SN) senses the channel idle, the proposed scheme uses the residual idle time distribution to estimate the transmissi...

The increasing use of computers for saving valuable data imposes stringent reliability constraints on storage systems. Reliability improvement via use of redundancy is a common practice. As the disk capacity improves, advanced techniques such as disk scrubbing are being employed to proactively fix latent sector errors. These techniques utilize the disk idle time for reliability improvement. How...

The utilization of idle compute cycles has been known as most promising and cost-effective way to build a large scale high performance computing system, but not widely used because of the lack of effective idleness prediction techniques. In this paper, we argue PCs at university computer labs have a great potential for the utilization of idle CPU cycles, and propose two techniques for predictin...

We develop a methodology for analyzing the performance and stability of a server that maintains a multilevel data structure to service a set of access operations for (key,value) records. A subset of the operations executed by the server (e.g., insert and delete) require the multilevel data structure be reorganized so that the server can execute all subsequent requests eeciently. We study how of...

spend much of their time idle, and various schemes have been proposed to use this idle time productively. We have used this approach to improve overall performance in storage systems. The most common approach is to off-load activity from busy periods to less-busy ones in order to improve system responsiveness. In addition, speculative work can be performed in idle periods in the hope that it wi...