Sciweavers

4616 search results - page 147 / 924
» The Communication Complexity of Correlation
Sort
View
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 10 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
ICC
2008
IEEE
145views Communications» more  ICC 2008»
16 years 29 days ago
A Low-Complexity Synchronization Design for MB-OFDM Ultra-Wideband Systems
In this paper, we investigate the low-complexity synchronization design for multi-band orthogonalfrequency-division-multiplexing (MB-OFDM) ultra-wideband (UWB) systems. We propose...
Zhenzhen Ye, Chunjie Duan, Philip V. Orlik, Jinyun...
ICCAD
2003
IEEE
188views Hardware» more  ICCAD 2003»
16 years 3 months ago
Communication-Aware Task Scheduling and Voltage Selection for Total Systems Energy Minimization
Abstract: In this paper, we present an interprocessor communication-aware task scheduling algorithm applicable to a multiprocessor system executing an application with dependent ta...
Girish Varatkar, Radu Marculescu
GPCE
2008
Springer
15 years 7 months ago
Typing communicating component assemblages
Building complex component-based software architectures can lead to subtle assemblage errors. In this paper, we introduce a typesystem-based approach to avoid message handling err...
Michael Lienhardt, Alan Schmitt, Jean-Bernard Stef...
SPAA
2009
ACM
16 years 7 months ago
Mapping filtering streaming applications with communication costs
In this paper, we explore the problem of mapping filtering streaming applications on large-scale homogeneous platforms, with a particular emphasis on communication models and thei...
Kunal Agrawal, Anne Benoit, Fanny Dufossé, ...