Abstract. We consider asynchronous networks of finite-state systems communicating via a combination of reliable and lossy fifo channels. Depending on the topology, the reachability...
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
A new method of retiming plesiochronous data is described. This method features latency of less than a cell-time and requires only minimal support circuitry. No flow control or ha...
Larry R. Dennison, William J. Dally, Thucydides Xa...
Abstract— Large scale distributed computing infrastructure captures the use of high number of nodes, poor communication performance and continously varying resources that are not...
Parallel computing on clusters of workstations is attractive because of the low costs in comparison to MPPs, but the speed of the local area network limits the class of applicatio...
Koen Langendoen, Rutger F. H. Hofman, Henri E. Bal