Sciweavers

1765 search results - page 284 / 353
» Communication Scheduling
Sort
View
CL
2007
Springer
14 years 12 months ago
A bulk-synchronous parallel process algebra
The CCS (Calculus of Communicating Systems) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness i...
Armelle Merlin, Gaétan Hains
DPD
2002
114views more  DPD 2002»
14 years 11 months ago
Query Decomposition for a Distributed Object-Oriented Mediator System
The mediator-wrapper approach to integrate data from heterogeneous data sources has usually been centralized in the sense that a single mediator system is placed between a number o...
Vanja Josifovski, Tore Risch
SP
2002
IEEE
147views Security Privacy» more  SP 2002»
14 years 11 months ago
CX: A scalable, robust network for parallel computing
CX, a network-based computational exchange, is presented. The system's design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks...
Peter R. Cappello, Dimitros Mourloukos
INFOCOM
2010
IEEE
14 years 10 months ago
Distributed Algorithms for Approximating Wireless Network Capacity
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
Michael Dinitz
INFOCOM
2010
IEEE
14 years 10 months ago
Throughput Analysis of Multiple Access Relay Channel under Collision Model
—Despite much research on the throughput of relaying networks under idealized interference models, many practical wireless networks rely on physical-layer protocols that preclude...
Seyed A. Hejazi, Ben Liang