4081 search results - page 496 / 817 » Scheduling in polling systems |
182
Voted
ICALP
2001
Springer
15 years 12 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
178
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents language features for High Performance Fortran HPF to specify non-local access patterns of distributed arrays, called halos, and to control the communication as...
216
click to vote
IPPS
1996
IEEE
15 years 11 months ago
1996
IEEE
We introduce dag consistency, a relaxed consistency model for distributed shared memory which is suitable for multithreaded programming. We have implemented dag consistency in sof...
212
click to vote
EURONGI
2006
Springer
15 years 11 months ago
2006
Springer
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...
196
Voted
PATAT
2000
Springer
15 years 11 months ago
2000
Springer
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...