Sciweavers

1205 search results - page 148 / 241
» On P Systems with Bounded Parallelism
Sort
View
IPPS
2006
IEEE
14 years 4 months ago
Monitoring remotely executing shared memory programs in software DSMs
Peer-to-Peer (P2P) cycle sharing over the Internet has become increasingly popular as a way to share idle cycles. A fundamental problem faced by P2P cycle sharing systems is how t...
Long Fei, Xing Fang, Y. Charlie Hu, Samuel P. Midk...
ICPPW
2006
IEEE
14 years 4 months ago
Model Checking Control Communication of a FACTS Device
This paper concerns the design and verification of a realtime communication protocol for sensor data collection and processing between an embedded computer and a DSP. In such sys...
David A. Cape, Bruce M. McMillin, James K. Townsen...
IPPS
2006
IEEE
14 years 4 months ago
Modelling job allocation where service duration is unknown
In this paper a novel job allocation scheme in distributed systems (TAG) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size ...
Nigel Thomas
HPDC
2003
IEEE
14 years 3 months ago
Trace-Based Simulations of Processor Co-Allocation Policies in Multiclusters
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
Anca I. D. Bucur, Dick H. J. Epema
CONCUR
2010
Springer
13 years 10 months ago
Conditional Automata: A Tool for Safe Removal of Negligible Events
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
Roberto Segala, Andrea Turrini