Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Resource CoAllocation for Scheduling Tasks with Dependencies, in Grid  [PDF]
Diana Moise,Eliza Moise,Florin Pop,Valentin Cristea
Computer Science , 2011,
Abstract: Scheduling applications on wide-area distributed systems is useful for obtaining quick and reliable results in an efficient manner. Optimized scheduling algorithms are fundamentally important in order to achieve optimized resources utilization. The existing and potential applications include many fields of activity like satellite image processing and medicine. The paper proposes a scheduling algorithm for tasks with dependencies in Grid environments. CoAllocation represents a strategy that provides a schedule for task with dependencies, having as main purpose the efficiency of the schedule, in terms of load balancing and minimum time for the execution of the tasks.
A Reliable Distributed Grid Scheduler for Independent Tasks
Kovvur Ram Mohan Rao,S Ramachandram,Vijaya Kumar Kadappa,A. Govardhan
International Journal of Computer Science Issues , 2011,
Abstract: Scheduling of jobs is one of the crucial tasks in grid environment. We consider non-preemptive scheduling of independent tasks in a computational grid. Recently, a general distributed scalable grid scheduler (GDS) was proposed, which prioritizes mission-critical tasks while maximizing the number of tasks meeting deadlines. However, the GDS scheduler did not consider the reliability factor, which may result in low successful schedule rates. In this paper, we propose a novel distributed grid scheduler which takes reliability factor (RDGS) into consideration with respect to the failure of grid nodes. The proposed scheduler invokes the tasks allocated to deficient grid nodes and maintains them in a queue. Further the queued tasks are rescheduled to the other nodes of the grid. It is observed that RDGS scheduler shows a significant improvement in terms of successfully scheduled tasks as compared to a variation of GDS without priority and deadlines (GDS-PD). The results of our exhaustive simulation experiments demonstrate the superiority of RDGS over the GDS-PD scheduler.
Uncertainty analysis of resource scheduling in grid computation

WANG Tian-qing,XIE Jun,ZENG Zhou,

计算机应用 , 2007,
Abstract: Resource scheduling technology is a part of grid core service technology. In the process of the Grid system emulation experiment, many uncertain factors of resource scheduling were found. These factors would influence qualities of Grid system in various degrees. As a kind of learned disquisition based on experiment, the uncertain factors t found in experiment were analyzed, and resource scheduling strategy was improved accordingly.
Grid Dependent Tasks Security Scheduling Model and DPSO Algorithm  [cached]
Hai Zhu,Yuping Wang,Zhanxin Ma,Hecheng Li
Journal of Networks , 2011, DOI: 10.4304/jnw.6.6.850-857
Abstract: Due to the security threat to task scheduling problems in the grid environment, by considering both the inherent security and behavior safety of grid resource nodes, security benefit functions and credibility assessment strategies of grid resource nodes are constructed respectively. At the same time, the corresponding membership function is established in order to establish the membership between task security requirements and resource security attributes. Based on these, a new grid dependent tasks security scheduling model is set up. In order to solve this model, the particle evolution equation is re-designed by combining the specific characteristics of the dependent task scheduling problem. Meanwhile, in order to prevent the algorithm falling into local optimum, a uniform speed of disturbance is adopted and a new discrete Particle Swarm Optimization algorithm is proposed. Simulation results show that this algorithm has better scheduling length and higher safety performance than the genetic algorithm.
A Double Min Min Algorithm for Task Metascheduler on Hypercubic P2P Grid Systems  [PDF]
D. Doreen Hephzibah Miriam,K. S. Easwarakumar
International Journal of Computer Science Issues , 2010,
Abstract: Most of the existing solutions on task scheduling and resource management in grid computing are based on the traditional client/ server model, enforcing a homogeneous policy on making decisions and limiting the flexibility, unpredictable reliability and scalability of the system. Thus, we need well organized system architecture to provide high system availability with task scheduling scheme for Grid system. In this paper, we integrate Grid with P2P on to the extended Hypercube topology for task scheduling and load balancing, which gives optimal makespan and balances the load. We propose an efficient SPA based task scheduling algorithm named Double Min Min Algorithm which performs scheduling in order to enhance system performance in Hypercubic P2P Grid (HPGRID). The simulation result shows that the SPA based Double Min Min scheduling minimizes the makespan with load balancing and guarantees the high system availability in system performance. At last, the SPA based Double Min Min algorithm is compared with traditional Min Min and Max Min algorithm, by the experiment evaluation it shows that the new algorithm has a better quality of system load balancing and the utilization of system resources.
Using ant algorithm to schedule tasks in grid

XU Zhi-hong,SUN Ji-zhou,

计算机应用 , 2005,
Abstract: The ant algorithm was put into grid to do task schedule in this paper, and every parameter of the algorithm was detected and the best parameters were selected for ant scheduling, the ant scheduling was designed and relized, task scheduling and resource management were combined, and attention to load balance and QoS was given, the results is satisfactory.
Decentralized Scheduling Algorithm for DAG Based Tasks on P2P Grid  [PDF]
Piyush Chauhan,Nitin
Journal of Engineering , 2014, DOI: 10.1155/2014/202843
Abstract: Complex problems consisting of interdependent subtasks are represented by a direct acyclic graph (DAG). Subtasks of this DAG are scheduled by the scheduler on various grid resources. Scheduling algorithms for grid strive to optimize the schedule. Nowadays a lot of grid resources are attached by P2P approach. Grid systems and P2P model both are newfangled distributed computing approaches. Combining P2P model and grid systems we get P2P grid systems. P2P grid systems require fully decentralized scheduling algorithm, which can schedule interreliant subtasks among nonuniform computational resources. Absence of central scheduler caused the need for decentralized scheduling algorithm. In this paper we have proposed scheduling algorithm which not only is fruitful in optimizing schedule but also does so in fully decentralized fashion. Hence, this unconventional approach suits well for P2P grid systems. Moreover, this algorithm takes accurate scheduling decisions depending on both computation cost and communication cost associated with DAG’s subtasks. 1. Introduction Splitting a huge job into subtasks yields interdependent subtasks. Once predecessor subtasks return results only then will the execution of successor subtask take place. To characterize a set of subtasks and their dependency on each other we can use directed acyclic graph (DAG). Nodes represent subtasks and dependencies are denoted by arc joining the two nodes. Most of the DAG tasks are highly computation and communication intensive. Intertask dependencies lead to a very complex scenario to find a solution in an efficient manner. Moreover, because of financial constraints most of the organizations do not own high-end computational resources like cluster of supercomputers. The grid provides a solution to get out of this situation. We can access computational resources available on the grid and schedule our DAG based task upon them. Scheduling is the method to shortlist nodes from the available computational resources and then assign tasks upon them in an efficient manner. A lot of scheduling algorithms [1] are in place to schedule tasks upon grid [2, 3]. However, they use either single server as central scheduler or metascheduler approach. Due to political causes, depending upon central scheduler in a grid computing environment is not viable. Problem with metascheduler takes place when no single cluster has adequate computational resources to execute the bulky job. Moreover, scalability and bottleneck problems are present in both meta- and central-scheduler approach. These shortcomings directed the
GPCALMA, a mammographic CAD in a GRID connection  [PDF]
U. Bottigli,P. G. Cerello,P. Delogu,M. E. Fantacci,F. Fauci,B. Golosio,A. Lauria,E. Lopez Torres,R. Magro,G. L. Masala,P. Oliva,R. Palmiero,G. Raso,A. Retico,S. Stumbo,S. Tangaro
Physics , 2003,
Abstract: Purpose of this work is the development of an automatic system which could be useful for radiologists in the investigation of breast cancer. A breast neoplasia is often marked by the presence of microcalcifications and massive lesions in the mammogram: hence the need for tools able to recognize such lesions at an early stage. GPCALMA (Grid Platform Computer Assisted Library for MAmmography), a collaboration among italian physicists and radiologists, has built a large distributed database of digitized mammographic images (at this moment about 5500 images corresponding to 1650 patients). This collaboration has developed a CAD (Computer Aided Detection) system which, installed in an integrated station, can also be used for digitization, as archive and to perform statistical analysis. With a GRID configuration it would be possible for the clinicians tele- and co-working in new and innovative groupings ('virtual organisations') and, using the whole database, by the GPCALMA tools several analysis can be performed. Furthermore the GPCALMA system allows to be abreast of the CAD technical progressing into several hospital locations always with remote working by GRID connection. We report in this work the results obtained by the GPCALMA CAD software implemented with a GRID connection.
Static Scheduling Algorithms Based on Connective-number of Type a+bi for Uncertain Computing Grid


计算机科学 , 2007,
Abstract: Job scheduling algorithms are kernel technique in task management system of computing grid. Because the dynamic and uncertainty exist in grid environment, the traditional job scheduling algorithms cannot be applied effectively in the real open, heterogene
The Living Application: a Self-Organising System for Complex Grid Tasks  [PDF]
D. Groen,S. Harfst,S. Portegies Zwart
Physics , 2009, DOI: 10.1177/1094342009347891
Abstract: We present the living application, a method to autonomously manage applications on the grid. During its execution on the grid, the living application makes choices on the resources to use in order to complete its tasks. These choices can be based on the internal state, or on autonomously acquired knowledge from external sensors. By giving limited user capabilities to a living application, the living application is able to port itself from one resource topology to another. The application performs these actions at run-time without depending on users or external workflow tools. We demonstrate this new concept in a special case of a living application: the living simulation. Today, many simulations require a wide range of numerical solvers and run most efficiently if specialized nodes are matched to the solvers. The idea of the living simulation is that it decides itself which grid machines to use based on the numerical solver currently in use. In this paper we apply the living simulation to modelling the collision between two galaxies in a test setup with two specialized computers. This simulation switces at run-time between a GPU-enabled computer in the Netherlands and a GRAPE-enabled machine that resides in the United States, using an oct-tree N-body code whenever it runs in the Netherlands and a direct N-body solver in the United States.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.