Study of Scheduling Strategies in a Dynamic Data Grid Environment

• Published in: Distributed Computing - IWDC 2004 pp. 88 - 94
• Main Authors: Dheepak, R. A., Ali, Shakeb, Sengupta, Shubhashis, Chakrabarti, Anirban
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 01.01.2004
• Series: Lecture Notes in Computer Science
• Subjects: Average Queue Size; Data Grid; Queue Size; Replication Strategy; Schedule Strategy
• ISBN: 9783540240761; 3540240764
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-540-30536-1_11

Data grids seek to harness geographically distributed resources for large-scale data-intensive problems. Such problems involve loosely coupled jobs and large data sets mostly distributed geographically. Data grids have found applications in scientific research, in the field of high-energy Physics, Life Sciences etc. The issues that need to be considered in the data grid research area include: resource management including computation management and data management. Computation management include scheduling of jobs, scalability, response time involved in such scheduling, while data management include data replication in selected sited, data movement when required. Therefore, scheduling and replication assumes great importance in a data grid environment. In this paper, we have developed several scheduling strategies based on a developed replication strategy. The scheduling strategies are called Matching based Scheduling (MJS), Cost base Scheduling (CJS) and Latency based Scheduling (LJS). Among these, LJS and CJS perform similarly and MJS performs worse than both of them.