1755 search results - page 102 / 351 » An efficient simulation algorithm based on abstract interpre... |
168
click to vote
OPODIS
2010
15 years 4 months ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
177
click to vote
ICCD
2004
IEEE
16 years 3 months ago
2004
IEEE
This paper presents a novel approach to reducing the complexity of the transient linear circuit analysis for a hybrid structured clock network. Topology reduction is first used to...
150
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
172
click to vote
TC
2002
15 years 6 months ago
2002
Abstract--Personal communication service (PCS) networks offer mobile users multimedia applications with different quality-ofservice (QoS) and bandwidth requirements. This paper pro...
232
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...