Sciweavers

803 search results - page 89 / 161
» Independence in Direct-Product Graphs
Sort
View
HPCC
2009
Springer
14 years 10 months ago
Graph-Based Task Replication for Workflow Applications
Abstract--The Grid is an heterogeneous and dynamic environment which enables distributed computation. This makes it a technology prone to failures. Some related work uses replicati...
Raúl Sirvent, Rosa M. Badia, Jesús L...
PC
2012
228views Management» more  PC 2012»
13 years 8 months ago
DAGuE: A generic distributed DAG engine for High Performance Computing
— The frenetic development of the current architectures places a strain on the current state-of-the-art programming environments. Harnessing the full potential of such architectu...
George Bosilca, Aurelien Bouteiller, Anthony Danal...
CORR
2007
Springer
155views Education» more  CORR 2007»
15 years 23 days ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian
96
Voted
JGT
2007
130views more  JGT 2007»
15 years 20 days ago
Vertex partitions and maximum degenerate subgraphs
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
Martín Matamala
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
15 years 14 days ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang