Sciweavers

2924 search results - page 424 / 585
» Lower Bounds in Distributed Computing
Sort
View
146
Voted
ICS
2000
Tsinghua U.
15 years 8 months ago
Improving parallel system performance by changing the arrangement of the network links
The Midimew network is an excellent contender for implementing the communication subsystem of a high performance computer. This network is an optimal 2D topology in the sense ther...
Valentin Puente, Cruz Izu, José A. Gregorio...
DCOSS
2010
Springer
15 years 6 months ago
Wireless Jamming Localization by Exploiting Nodes' Hearing Ranges
Jamming attacks are especially harmful when ensuring the dependability of wireless communication. Finding the position of a jammer will enable the network to actively exploit a wid...
Zhenhua Liu, Hongbo Liu, Wenyuan Xu, Yingying Chen
CCS
2010
ACM
15 years 5 months ago
Recruiting new tor relays with BRAIDS
Tor, a distributed Internet anonymizing system, relies on volunteers who run dedicated relays. Other than altruism, these volunteers have no incentive to run relays, causing a lar...
Rob Jansen, Nicholas Hopper, Yongdae Kim
147
Voted
SPAA
2010
ACM
15 years 5 months ago
Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures
We present a scheduling algorithm of stream programs for multi-core architectures called team scheduling. Compared to previous multi-core stream scheduling algorithms, team schedu...
JongSoo Park, William J. Dally
EUROPAR
2010
Springer
15 years 5 months ago
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
Marin Bougeret, Pierre-François Dutot, Klau...