Sciweavers

5149 search results - page 605 / 1030
» Timed Asynchronous Distributed Systems
Sort
View
CONCUR
2000
Springer
15 years 8 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
149
Voted
SRDS
2003
IEEE
15 years 10 months ago
Performance and Effectiveness Analysis of Checkpointing in Mobile Environments
Many mathematical models have been proposed to evaluate the execution performance of an application with and without checkpointing in the presence of failures. They assume that th...
Xinyu Chen, Michael R. Lyu
CCGRID
2009
IEEE
15 years 11 months ago
Performance under Failures of DAG-based Parallel Computing
— As the scale and complexity of parallel systems continue to grow, failures become more and more an inevitable fact for solving large-scale applications. In this research, we pr...
Hui Jin, Xian-He Sun, Ziming Zheng, Zhiling Lan, B...
IPPS
2006
IEEE
15 years 11 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
CCGRID
2005
IEEE
15 years 10 months ago
Dynamic load balancing experiments in a grid
Connected world-widely distributed computers and data systems establish a global source of processing power and data, called a grid. Key properties of a grid are the fact that com...
Menno Dobber, Ger Koole, Robert D. van der Mei