443 search results - page 49 / 89 » Relations in Concurrency |
OSDI
1994
ACM
13 years 10 months ago
1994
ACM
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rat...
IANDC
2000
13 years 8 months ago
2000
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...
ICPP
2007
IEEE
14 years 3 months ago
2007
IEEE
The complexity of parallel I/O systems lies in the deep I/O stack with many software layers and concurrent I/O request handling at multiple layers. This paper explores multi-layer...
COLCOM
2007
IEEE
13 years 10 months ago
2007
IEEE
—Constraints allow users to declare relationships among objects and let the constraint systems maintain and satisfy these relationships. Formulas have been adopted to express con...
DC
2010
13 years 9 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...