Sciweavers

315 search results - page 6 / 63
» Scheduling with Implicit Information in Distributed Systems
Sort
View
FORMATS
2007
Springer
15 years 3 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
IPPS
2000
IEEE
15 years 1 months ago
Buffered Coscheduling: A New Methodology for Multitasking Parallel Jobs on Distributed Systems
Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems. The methodology has two primary features: communica...
Fabrizio Petrini, Wu-chun Feng
GCC
2005
Springer
15 years 3 months ago
Knowledge Acquisition Based on the Global Concept of Fuzzy Cognitive Maps
Combination of prior knowledge and implicit knowledge hidden in the data of system can enhance the quality of information services in Knowledge Grid. Fuzzy Cognitive Maps (FCMs) ar...
Xiangfeng Luo
100
Voted
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
14 years 8 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
PDPTA
2004
14 years 11 months ago
Hierarchical Scheduling for State-based Services
Abstract-- Service descriptions based on type hiernd abstract service states ruling the availability of operations permit more secure service combinations in distributed systems de...
Jens Bruhn, Sven Kaffille, Guido Wirtz