2941 search results - page 520 / 589 » Communication Performance Issues for Two Cluster Computers |
164
click to vote
ICS
1994
Tsinghua U.
15 years 7 months ago
1994
Tsinghua U.
This paper describes the design of a compiler which can translate out-of-core programs written in a data parallel language like HPF. Such a compiler is required for compiling larg...
134
Voted
IEEESCC
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract—Service modeling and composition is a fundamental method for offering advanced functionality by combining a set of primitive services provided by the system. Unlike in t...
128
Voted
DIALM
2005
ACM
15 years 5 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
144
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 3 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
149
Voted
IMC
2010
ACM
15 years 1 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...