Sciweavers

241 search results - page 46 / 49
» Implicit Parallelism
Sort
View
SPAA
2004
ACM
14 years 3 months ago
Adaptive channel queue routing on k-ary n-cubes
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
Arjun Singh, William J. Dally, Amit K. Gupta, Bria...
SPAA
2010
ACM
14 years 2 months ago
TLRW: return of the read-write lock
TL2 and similar STM algorithms deliver high scalability based on write-locking and invisible readers. In fact, no modern STM design locks to read along its common execution path b...
David Dice, Nir Shavit
SIGGRAPH
2000
ACM
14 years 2 months 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
ICDCS
2010
IEEE
14 years 1 months ago
Sentomist: Unveiling Transient Sensor Network Bugs via Symptom Mining
—Wireless Sensor Network (WSN) applications are typically event-driven. While the source codes of these applications may look simple, they are executed with a complicated concurr...
Yangfan Zhou, Xinyu Chen, Michael R. Lyu, Jiangchu...
CLUSTER
2004
IEEE
14 years 1 months ago
Cluster computing environment supporting single system image
Single system image(SSI) systems have been the mainstay of high-performance computing for many years. SSI requires the integration and aggregation of all types of resources in a c...
Min Choi, DaeWoo Lee, Seung Ryoul Maeng