1765 search results - page 261 / 353 » Communication Scheduling |
105
click to vote
PPOPP
1993
ACM
15 years 4 months ago
1993
ACM
This paper discusses some of the issues involved in implementing a shared-address space programming model on large-scale, distributed-memory multiprocessors. While such a programm...
ICC
2009
IEEE
14 years 9 months ago
2009
IEEE
In this paper we describe a model for calculating the aggregate interference encountered by primary receivers in the presence of randomly placed cognitive radios (CRs). We show tha...
106
click to vote
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
SPAA
2009
ACM
16 years 13 days ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
104
click to vote
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...