Sciweavers

1528 search results - page 97 / 306
» On Signatures for Communication Graphs
Sort
View
ICPADS
1998
IEEE
14 years 2 months ago
Symbolic Partitioning and Scheduling of Parameterized Task Graphs
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 10 months ago
Local algorithms in (weakly) coloured graphs
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...
HICSS
2011
IEEE
179views Biometrics» more  HICSS 2011»
13 years 1 months ago
EventGraphs: Charting Collections of Conference Connections
EventGraphs are social media network diagrams of conversations related to events, such as conferences. Many conferences now communicate a common “hashtag” or keyword to identi...
Derek L. Hansen, Marc A. Smith, Ben Shneiderman
ICC
2007
IEEE
124views Communications» more  ICC 2007»
14 years 4 months ago
Exploring the Local Connectivity Preference in Internet AS Level Topology
—The Internet AS level topology, upon which BGP4 runs, plays a vital role in the analysis and study of the global routing behavior. However, the study of the topology itself is n...
Guoqiang Zhang, Guoqing Zhang
IPPS
2006
IEEE
14 years 4 months ago
Parallelizing post-placement timing optimization
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...
Jiyoun Kim, Marios C. Papaefthymiou, José N...