Sciweavers

1488 search results - page 262 / 298
» Experimental Assessment of Parallel Systems
Sort
View
IPPS
2003
IEEE
14 years 29 days ago
The Case for Fair Multiprocessor Scheduling
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
Anand Srinivasan, Philip Holman, James H. Anderson...
SIGGRAPH
2000
ACM
14 years 2 days ago
Timewarp rigid body simulation
The traditional high-level algorithms for rigid body simulation work well for moderate numbers of bodies but scale poorly to systems of hundreds or more moving, interacting bodies...
Brian Mirtich
SPAA
1996
ACM
13 years 12 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
DEBS
2007
ACM
13 years 11 months ago
SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication
We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. Spider...
Gregory Chockler, Roie Melamed, Yoav Tock, Roman V...
EDO
2006
Springer
13 years 11 months ago
An extensible, lightweight architecture for adaptive J2EE applications
Server applications with adaptive behaviors can adapt their functionality in response to environmental changes, and significantly reduce the on-going costs of system deployment an...
Ian Gorton, Yan Liu, Nihar Trivedi