2300 search results - page 280 / 460 » Maximally Concurrent Programs |
168
click to vote
TACAS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
158
click to vote
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
Online transaction processing (OLTP) is a multibillion dollar industry with high-end database servers employing state-of-the-art processors to maximize performance. Unfortunately,...
268
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
165
click to vote
AIPS
2008
15 years 8 months ago
2008
In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably j...
183
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
This paper addresses two important challenges for current P2P systems, namely churn and selfishness. First, we report on a system [19] whose desirable properties (small peer degre...