7092 search results - page 1356 / 1419 » Parallelizing constraint programs |
ASPLOS
1994
ACM
14 years 22 hour ago
1994
ACM
Synchronization algorithms that are efficient across a wide range of applications and operating conditions are hard to design because their performance depends on unpredictable ru...
ICALP
1992
Springer
14 years 2 hour ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
CTCS
1989
Springer
13 years 12 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
ASPLOS
2006
ACM
13 years 11 months ago
2006
ACM
This paper proposes new network interface controller (NIC) designs that take advantage of integration with the host CPU to provide increased flexibility for operating system kerne...
ASPLOS
2010
ACM
13 years 10 months ago
2010
ACM
Many parallel applications exhibit unpredictable communication between threads, leading to contention for shared objects. The choice of contention management strategy impacts stro...