The Community for Technology Leaders
Heterogeneous Computing Workshop (2000)
Cancun, Mexico
May 1, 2000 to May 1, 2000
ISSN: 1097-5209
ISBN: 0-7695-0556-2
pp: 116
Michael D. Beynon , University of Maryland at College Park
Tahsin Kurc , University of Maryland at College Park
Alan Sussman , University of Maryland at College Park
Joel Saltz , University of Maryland at College Park
Applications that use collections of very large, distributed datasets have become an increasingly important part of science and engineering. With high performance wide-area networks become more pervasive, there is interest in making collective use of distributed computational and data resources. Recent work has converged to the notion of the Grid, which attempts to uniformly present a heterogeneous collection of distributed resources. Current Grid research covers many areas from low-level infrastructure issues to high-level application concerns. However, providing support for efficient exploration and processing of very large scientific datasets stored in distributed archival storage systems remains a challenging research issue.We have initiated an effort that focuses on developing efficient data-intensive applications in a Grid environment. In this paper, we present a framework, called filter-stream programming that represents the processing units of a data-intensive application as a set of filters, which are designed to be efficient in their use of memory and scratch space. We describe a prototype infrastructure that supports execution of applications using the proposed framework. We present the implementation of two applications using the filter-stream programming framework, and discuss experimental results demonstrating the effects of heterogeneous resources on application performance.
Data-intensive applications, application decomposition, data analysis and exploration

T. Kurc, A. Sussman, J. Saltz and M. D. Beynon, "Design of a Framework for Data-Intensive Wide-Area Applications," Heterogeneous Computing Workshop(HCW), Cancun, Mexico, 2000, pp. 116.
92 ms
(Ver 3.3 (11022016))