Optimizing execution of component-based applications using group instances

被引：8

作者：

Beynon, MD ^{[1
]}

Kurc, T ^{[1
]}

Sussman, A ^{[1
]}

Saltz, J ^{[1
]}

机构：

[1] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA

来源：

FIRST IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER COMPUTING AND THE GRID, PROCEEDINGS | 2001年

关键词：

D O I：

10.1109/CCGRID.2001.923176

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Recent research on programming models for developing applications in the Grid has proposed component-based models as a viable approach, in which an application is composed of multiple interacting computational objects. We have been developing a framework, called filter-stream programming, for building data-intensive applications that query, analyze and manipulate very large data sets in a distributed environment. In this model, the processing structure of an application is represented as a set of processing units, referred to as filters. In this paper we develop the problem of scheduling instances of a filter group. A filter group is a set of filters collectively performing a computation for an application. In particular we seek the answer to the following question: should a new instance be created, or an existing one reused? We experimentally investigate the effects of instantiating multiple filter groups on performance tinder varying application characteristics.

引用

页码：56 / 63

页数：8

共 9 条

[1]

Aeschlimann M, 1999, INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, PROCEEDINGS, P1833

[2]

AMIRI K, 1999, CMUCS99140

[3]

Beynon M. D., 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556), P116, DOI 10.1109/HCW.2000.843737

[4]

BEYNON MD, 2000, P 2000 MASS STOR SYS

[5]

ISERT C, 2000, 14 INT PAR DISTR PRO, P641

[6]

KURC T, 2000, CSTR4133 UMIACS

[7]

KURC T, 2000, UMIACSTR200026

[8]

PALE B, 2000, IEEE INT HIGH PERF D

[9]

RODRIGUEZMARTIN.M, 2000, P 2000 ACM SIGMOD IN, V29, P213

← 1 →