Sciweavers

4045 search results - page 160 / 809
» Special Section on Parallel Distributed Computing and Networ...
Sort
View
IPPS
1996
IEEE
15 years 2 months ago
Benefits of Processor Clustering in Designing Large Parallel Systems: When and How?
Advances in multiprocessor interconnect technologyare leading to high performance networks. However, software overheadsassociated with message passing are limiting the processors ...
Debashis Basak, Dhabaleswar K. Panda, Mohammad Ban...
PODC
2009
ACM
15 years 2 months ago
Brief announcement: locality-based aggregate computation in wireless sensor networks
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
Jen-Yeu Chen, Gopal Pandurangan, Jianghai Hu
HPCA
2001
IEEE
15 years 10 months ago
Automatically Mapping Code on an Intelligent Memory Architecture
This paper presents an algorithm to automatically map code on a generic intelligent memory system that consists of a host processor and a simpler memory processor. To achieve high...
Jaejin Lee, Yan Solihin, Josep Torrellas
EUROPAR
2007
Springer
15 years 1 months ago
Increasing Parallelism for Workflows in the Grid
Workflow applications executed in Grid environments are not able to take advantage of all the potential parallelism they might have. This limitation in the usage of parallelism com...
Jonathan Martí, Jesus Malo, Toni Cortes
IPPS
2009
IEEE
15 years 4 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...