Sciweavers

1519 search results - page 111 / 304
» Network Partitioning of Data Parallel Computations
Sort
View
DCOSS
2006
Springer
14 years 27 days ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
WCNC
2010
IEEE
13 years 7 months ago
Combining Parallel Sequence Spread Spectrum (PSSS) with OFDM - Concept and Simulation Results
—In this paper, we present a novel multi-carrier spread spectrum (MCSS) system which uses Parallel Sequence Spread Spectrum (PSSS) as its spreading transform. This technique call...
Paulo Isagani M. Urriza, Joel Joseph S. Marciano J...
GRID
2005
Springer
14 years 2 months ago
Protecting grid data transfer services with active network interfaces
A key goal of grid computing is to provide seamless access to shared computational and data resources across organizational boundaries, in distributed virtual organizations. Grid ...
Onur Demir, Michael R. Head, Kanad Ghose, Madhusud...
CASES
2003
ACM
14 years 2 months ago
Programming challenges in network processor deployment
Programming multi-processor ASIPs, such as network processors, remains an art due to the wide variety of architectures and due to little support for exploring different implement...
Chidamber Kulkarni, Matthias Gries, Christian Saue...
PPOPP
1995
ACM
14 years 23 days ago
Optimistic Active Messages: A Mechanism for Scheduling Communication with Computation
Low-overhead message passing is critical to the performance of many applications. Active Messages[27] reduce the software overhead for message handling: messages are run as handle...
Deborah A. Wallach, Wilson C. Hsieh, Kirk L. Johns...