Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli ...
High-performance execution in distributed computing environments often requires careful selection and configuration not only of computers, networks, and other resources but also o...
Steven Fitzgerald, Ian T. Foster, Carl Kesselman, ...
To date, systems offering multitasking for the JavaTM programming language either use one process or one class loader for each application. Both approaches are unsatisfactory. Usi...
UrbanSim is a modeling system for simulating the development of urban regions over periods of 20-30 years. Its purpose is to help evaluate alternative proposed policies and transp...
Dynamically partitioning of adaptive applications and migration of excess workload from overloaded processors to underloaded processors during execution are critical techniques ne...