سند علمی

Grid Simulation Tools for Job Scheduling and Data File Replication

چکیده

In recent years, grid computing has emerged as one of the main computational platforms to perform many extremely difficult and/or time-consuming tasks. The amount of data generated every second is in fact sometimes much more than what can be processed even by dedicated grids. This makes the design of optimum solutions to efficiently balance and deploy existing systems one of the main objectives/ bottleneck in grids. These computational platforms are, however, too complicated to estimate/gauge efficiently of any algorithm without actually testing it. Thus, because accessing real systems is almost impossible for many reasons, including cost and trust, simulation becomes one of the inevitable stages before actual deployment of any algorithm in this field. In this chapter, first several simulation tools are listed, and then the problem statement behind all these grids is mathematically modeled and presented. Simulation is one major step in modeling many real-world processes before their actual deployments. Proper simulations can provide an extensive study of a system and reveal its many unknown aspects before actual deployment, including, but not limited to, feasibility, behavioral, and performance analysis. Industrial processes, parallel and distributed systems, and environmental resources are among many that receive direct benefits from such simulations. Although simulations mean to 1

اسناد مشابه

  • An Enhanced Adaptive Scoring Job Scheduling Algorithm with Replication Strategy in Grid Environment

    سند علمی۲۰۱۴S. K. Aparnaa

    Grid computing is a form of distributed computing that involves coordinating and sharing data storage and network resource. The goal of grid job scheduling is to achieve high system throughput and match the job to the appropriate available computing resource. The complexity of sc

  • Task Scheduling and File Replication for Data-Intensive Jobs

    سند علمی۲۰۰۶Gaurav Khanna, Nagavijayalakshmi Vydyanathan, Umit Catalyurek, Tahsin Kurc

    This paper addresses the problem of efficient execution of a batch of data-intensive tasks with batch-shared I/O behavior, on coupled storage and compute clusters. Two scheduling schemes are proposed: 1) a 0-1 Integer Programming (IP) based approach, which couples task scheduling

  • Optorsim: a Simulation Tool for Scheduling and Replica Optimisation in Data Grids

    سند علمی۲۰۰۴D. G. Cameron, A. P. Millar, C. Nicholson, R. Carvajal-Schiaffino

    In large-scale Grids, the replication of files to different sites is an important data management mechanism which can reduce access latencies and give improved usage of resources such as network bandwidth, storage and computing power. In the search for an optimal data replication

  • Optorsim: A Grid Simulator for Studying Dynamic Data Replication Strategies

    سند علمی۲۰۰۳IJHPCAWilliam H. Bell, David G. Cameron, A. Paul Millar, Luigi Capozza

    Computational Grids process large, computationally intensive problems on small data sets. In contrast, Data Grids process large computational problems that in turn require evaluating, mining and producing large amounts of data. Replication, creating geographically disparate ident

  • A tool for automating network simulation and processing tracing data files

    سند علمی۲۰۱۳Simulation Modelling Practice and TheoryChristos Bouras, Savvas Charalambides, Michalis Drakoulelis, Georgios Kioumourtzis

    One of the most highly regarded discrete event simulators used for network simulation is NS-2 (Network Simulator). NS-2 executes simulation scenarios producing various data of which trace files are considered the most beneficial for evaluating a simulation. In this paper we prese

  • Enabling the Acceleration of Dust Simulation using Job Scheduling Methods in a Cloud Environment

    سند علمی۲۰۱۵Manzhu Yu, Chaowei Yang, Zhenlong Li, Kai Liu

    Dust modeling is highly computing intensive, and is normally executed through decomposition approach, by decomposing model domain evenly into multiple or many subdomains, which are then allocated to multiple computing nodes. The cost of data transfer due to communication among ne