2057 search results - page 16 / 412 » Scalable and Structured Scheduling |
ESA
2006
Springer
13 years 11 months ago
2006
Springer
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
ENTCS
2002
13 years 7 months ago
2002
The difficulty of finding errors caused by unexpected interleavings of threads in concurrent programs is well known. Model checkers can pinpoint such errors and verify correctness...
VLSID
1994
IEEE
13 years 11 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
CLUSTER
2003
IEEE
14 years 25 days ago
2003
IEEE
Moldable job scheduling has been proved to be effective compared to traditionaljob scheduling policies. It is based on the observation that most jobs submitted to a spaceshared pa...
WDAS
2000
13 years 9 months ago
2000
Present databases, whether on centralized or parallel DBMSs, do not deal well with scalability. We present an architecture for Wintel multicomputers termed AMOS-SDDS, coupling a h...