Sciweavers

1534 search results - page 202 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
CONCUR
1990
Springer
15 years 4 months ago
A Temporal Calculus of Communicating Systems
In this paper we describe the calculus TCCS, an extension of the process algebra CCS with temporal constructs. The calculus is useful for the formal analysis of the timing aspects...
Faron Moller, Chris M. N. Tofts
113
Voted
PC
2000
93views Management» more  PC 2000»
15 years 14 days ago
Scheduling outtrees of height one in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
Jacques Verriet
IJCAI
2001
15 years 2 months ago
An On-line Decision-Theoretic Golog Interpreter
We consider an on-line decision-theoretic interpreter and incremental execution of Golog programs. This new interpreter is intended to overcome some limitations of the off-line in...
Mikhail Soutchanski
HPCA
2011
IEEE
14 years 4 months ago
MOPED: Orchestrating interprocess message data on CMPs
Future CMPs will combine many simple cores with deep cache hierarchies. With more cores, cache resources per core are fewer, and must be shared carefully to avoid poor utilization...
Junli Gu, Steven S. Lumetta, Rakesh Kumar, Yihe Su...
97
Voted
PODC
2009
ACM
16 years 1 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer