TY - JOUR
T1 - Gallop
T2 - The Benefits of Wide-Area Computing for Parallel Processing
AU - Weissman, Jon B.
N1 - Funding Information:
1This work was partially funded by NSF ASC-9625000.
PY - 1998/11/1
Y1 - 1998/11/1
N2 - Internet computing has emerged, as an attractive paradigm for many applications that require access to distributed resources such as telemedicine, collaboratories, and transaction systems. For applications that require high performance, the Internet is assumed to be inappropriate. However, it is possible to obtain high performance for parallel scientific applications in an Internet environment. A wide-area scheduling system called Gallop has been developed to exploit opportunities for high performance using remote Internet resources for these applications. This paper describes the Gallop architecture and scheduling model, and performance results obtained for three parallel applications. The initial results indicate that wide-area parallel processing can lead to better performance even with Internet technology, but that current Internet bandwidth is a major bottleneck for file and binary transfer. This overhead limits the class of suitable applications to those that are large-grained or that will be run multiple times to amortize the transfer cost.
AB - Internet computing has emerged, as an attractive paradigm for many applications that require access to distributed resources such as telemedicine, collaboratories, and transaction systems. For applications that require high performance, the Internet is assumed to be inappropriate. However, it is possible to obtain high performance for parallel scientific applications in an Internet environment. A wide-area scheduling system called Gallop has been developed to exploit opportunities for high performance using remote Internet resources for these applications. This paper describes the Gallop architecture and scheduling model, and performance results obtained for three parallel applications. The initial results indicate that wide-area parallel processing can lead to better performance even with Internet technology, but that current Internet bandwidth is a major bottleneck for file and binary transfer. This overhead limits the class of suitable applications to those that are large-grained or that will be run multiple times to amortize the transfer cost.
UR - http://www.scopus.com/inward/record.url?scp=0009885470&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0009885470&partnerID=8YFLogxK
U2 - 10.1006/jpdc.1998.1487
DO - 10.1006/jpdc.1998.1487
M3 - Article
AN - SCOPUS:0009885470
SN - 0743-7315
VL - 54
SP - 183
EP - 205
JO - Journal of Parallel and Distributed Computing
JF - Journal of Parallel and Distributed Computing
IS - 2
ER -