Sciweavers

1095 search results - page 118 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
IPPS
2007
IEEE
15 years 11 months ago
Power-Aware Routing for Well-Nested Communications On The Circuit Switched Tree
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
Hatem M. El-Boghdadi
SPAA
2005
ACM
15 years 10 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
IPPS
2003
IEEE
15 years 10 months ago
Dynamic Power Management of Heterogeneous Systems
Power management is critical to power-constrained real-time systems. In this paper, we present a dynamic power management algorithm for real-time heterogeneous systems. Unlike oth...
Jinwoo Suh, Dong-In Kang, Stephen P. Crago
IPPS
2002
IEEE
15 years 9 months ago
Dynamic Power Management of Multiprocessor Systems
Power management is critical to power-constrained real-time systems. In this paper, we present a dynamic power management algorithm. Unlike other approaches that focus on the trad...
Jinwoo Suh, Dong-In Kang, Stephen P. Crago
SPAA
2010
ACM
15 years 9 months ago
Lightweight, robust adaptivity for software transactional memory
When a program uses Software Transactional Memory (STM) to synchronize accesses to shared memory, the performance often depends on which STM implementation is used. Implementation...
Michael F. Spear