2473 search results - page 174 / 495 » The Logic of Communication Graphs |
146
click to vote
EUROPAR
2005
Springer
15 years 9 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
112
Voted
IDMS
1998
Springer
15 years 8 months ago
1998
Springer
This position paper advocates a possible bridging of multiple heterogeneous formats and interfaces for hypermedia data and metadata. Rather than one more text, bit-stream or proced...
104
Voted
IPL
2006
15 years 3 months ago
2006
Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distinguishing characteristics of small-world networks are h...
118
Voted
JGAA
2008
15 years 3 months ago
2008
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
97
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Previous work on scheduling dynamic competitive jobs is focused on multiprocessors configurations. This paper presents a new distributed dynamic scheduling scheme for sporadic re...