Sciweavers

29 search results - page 3 / 6
» A Fault-Tolerant Parallel Heuristic for Assignment Problems
Sort
View
DCOSS
2008
Springer
13 years 9 months ago
Frugal Sensor Assignment
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro...
DAC
2005
ACM
14 years 8 months ago
Fault and energy-aware communication mapping with guaranteed latency for applications implemented on NoC
As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival prob...
Sorin Manolache, Petru Eles, Zebo Peng
ENC
2004
IEEE
13 years 11 months ago
Comparison of Scheduling Heuristics for Grid Resource Broker
In this paper, we consider parallel tasks scheduling problems for hierarchical decentralized systems that consist of homogeneous computational resources such as clusters, PCs and ...
Sergey Zhuk, Andrey Chernykh, Arutyun Avetisyan, S...
HPCC
2005
Springer
14 years 29 days ago
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
Doruk Bozdag, Ümit V. Çatalyürek,...
ASPDAC
2011
ACM
227views Hardware» more  ASPDAC 2011»
12 years 11 months ago
Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph
– This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has seve...
Tae-ho Shin, Hyunok Oh, Soonhoi Ha