Sciweavers

359 search results - page 39 / 72
» Multi-state Directed Acyclic Graphs
Sort
View
JSSPP
2010
Springer
14 years 9 months ago
Hierarchical Scheduling of DAG Structured Computations on Manycore Processors with Dynamic Thread Grouping
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
Yinglong Xia, Viktor K. Prasanna, James Li
ECAI
1998
Springer
15 years 3 months ago
Diagnosis of Active Systems
Abstract: Lazy computation is not new in model-based diagnosis of active systems (and of discreteevent systems in general). Up to a decade ago, diagnosis methods for discrete-event...
Pietro Baroni, Gianfranco Lamperti, Paolo Pogliano...
DSN
2000
IEEE
15 years 4 months ago
Fault-Secure Scheduling of Arbitrary Task Graphs to Multiprocessor Systems
In this paper, we propose new scheduling algorithms to achieve fault security in multiprocessor systems. We consider scheduling of parallel programs represented by directed acycli...
Koji Hashimoto, Tatsuhiro Tsuchiya, Tohru Kikuno
JMLR
2008
120views more  JMLR 2008»
14 years 11 months ago
Causal Reasoning with Ancestral Graphs
Causal reasoning is primarily concerned with what would happen to a system under external interventions. In particular, we are often interested in predicting the probability distr...
Jiji Zhang
DAM
2000
137views more  DAM 2000»
14 years 11 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...