A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
Evaluation of ARRG and the Fallback Cache in a number of realistic scenarios shows that the proposed techniques significantly improve the performance of gossiping algorithms in networks with limited connectivity ... Even in pathological situations, with 50% message loss and with 80% of the nodes behind a NAT, ARRG continues to work well. Existing algorithms fail in these circumstances. ... In a pathological scenario with a high loss rate and 80% of the nodes behind a NAT system, ARRG still performs well, while traditional gossiping techniques fail. ...doi:10.1145/1272366.1272386 dblp:conf/hpdc/DrostONB07 fatcat:dhskin2m5ffmvmdkxwdyd4l7fm
We apply the technique of hierarchical graph partitioning and thread reordering to the affinity graph to determine an optimal thread schedule. We have performed experiments on an SGI Altix system. ... This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. ... The authors would like to thank HPDC'07 reviewers for their valuable comments and suggestions on the initial draft of the paper. ...doi:10.1145/1272366.1272380 dblp:conf/hpdc/SongMD07 fatcat:mkkhtlxcajgllpz4bw5zuro5ma
To demonstrate the utility of this concept, and to enable the practical implementations of these examples and others, we have developed VTL. ... Examples of these network services include protocol transformations (e.g. ... HPDC' 07 , 07 June 25-29, 2007, Monterey, California, USA. Copyright 2007 ACM 978-1-59593-673-8/07/0006 ...$5.00. Figure 1 :Figure 2 : 12 Simple Performance overhead of VTL. ...doi:10.1145/1272366.1272370 dblp:conf/hpdc/LangeD07 fatcat:tqv7575qpfhhlejydyuxc5pahe