We consider a class of Markov chains known for its closed form transient and steady-state distributions. We show that some absorbing chains can be also seen as members of this clas...
We observe that existing methods for failure-tolerance are inefficient in their use of time, storage and computational resources. We aim to harness the power of idle desktop compu...
Designing computing equipment for a computer laboratory is not easy. In a class in a computer laboratory, it is not unusual that all students do the same thing simultaneously. Tre...
We describe imprecise calendars, a way to organize and schedule clusters of nodes in a computation grid. Imprecise calendars permit the easy and efficient sharing of resources bet...
Partitioning data parallel computations across a network of heterogeneous workstations is a dificult problem for the user: We have developed a runtime partitioning methodfor choos...