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

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

This paper considers the single machine scheduling problem with linear earliness and quadratic tardiness costs. The research on the version with inserted idle time focused on an exact approach, while several heuristics had already been proposed for the version with no idle time. These heuristics were then the basis for the development of new heuristic procedures for the version with idle time. ...

Workstation networks are an underutilized yet valuable resource for solving large-scale parallel problems. In this paper, we present \idle-initiated" techniques for eeciently scheduling large-scale parallel computations on workstation networks. By \idle-initiated," we mean that idle computers actively search out work to do rather than wait for work to be assigned. The idle-initiated scheduler o...

Distributed systems frequently have large numbers of idle computers and workstations. If we could make use of these, then considerable computing power could be harnessed at low cost. We analyze such systems using Brownian motion with drift to model the execution of a program distributed over the idle computers in a network of idle and busy processors, determining how the use of these “transient...

Most efforts at low-cost parallel computing assume a monopoly on the hardware being used. That all-or-nothing attitude ignores many machines dedicated to other activities, but which sit idle for 16 hours a day. However, naı̈ve attempts to utilize idle machines can interfere with their primary purpose. This paper describes the successful effort to unobtrusively farm idle machines, for an artifici...

We consider an M/M/N/K/FCFS system (N > 0, K ≥N), where the servers operate at (possibly) heterogeneous service rates. In this situation, the steady state behavior depends on the routing policy that is used to select which idle server serves the next job in queue. We define a class of idle-time-order-based policies (including, for example, Longest Idle Server First (LISF)) and show that all pol...