Community Sense and Response Systems: Your Phone as Quake Detector
The Caltech CSN project collects sensor data from thousands of personal devices for real-time response to dangerous earthquakes.
K. Mani Chandy
Advertisement
Author Archives
Distributed computation on graphs: shortest path algorithms
We use the paradigm of diffusing computation, introduced by Dijkstra and Scholten, to solve a class of graph problems. We present a detailed solution to the problem of computing shortest paths from a single vertex to all other vertices, in the presence of negative cycles.
Computational algorithms for product form queueing networks
In the last two decades there has been special interest in queueing networks with a product form solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given.
The impact of distributions and disciplines on multiple processor systems
Simple queueing models are used to study the performance tradeoffs of multiple processor systems. Issues considered include the impact of CPU service disciplines and distributions, level of multiprogramming, multitasking, and job priorities.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved