In this paper, we propose a task duplication based scheduling algorithm for avoiding useless duplication. In our algorithm, task duplication is divided into two phases: a task fill phase and a task duplication phase. In the task fill phase, tasks are duplicated and allocated to idle time slots in used processors. Namely, the task fill phase does not require additional idle processors. The task ...

In this paper, we examine the utility of exploiting idle memory in workstation pools. We attempt to answer the following questions. First, given a workstation pool, what fraction of the memory can be expected to be idle? This provides an estimate of the opportunity for hosting guest data. Second, what fraction of a individual host' s memory can be expected to be idle? This helps determine the r...

Consider a set P of n points in the plane and n radars located at these points. The radars are rotating perpetually (around their centre) with identical constant speeds, continuously emitting pulses of radio waves (modelled as half-infinite rays). A radar can “locate” (or detect) any object in the plane (e.g., using radio echo-location when its ray is incident to the object). We propose a model...

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...

We study aging behavior of an aqueous suspension of Laponite as a function of concentration of Laponite, concentration of salt, time elapsed since preparation of suspension (idle time), and temperature by carrying extensive rheological and conductivity experiments. We observe that temporal evolution of elastic moduli, which describes structural build-up and aging, shifts to low times for experi...

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...