Parameter-sweep has been widely adopted in large numbers of scientific applications. Parameter-sweep features need to be incorporated into grid workflows so as to increase the scale and scope of such applications. New...
详细信息
Parameter-sweep has been widely adopted in large numbers of scientific applications. Parameter-sweep features need to be incorporated into grid workflows so as to increase the scale and scope of such applications. New scheduling mechanisms and algorithms are required to provide optimized policy for resource allocation and task arrangement in such a case. This paper addresses scheduling sequential parameter-sweep tasks in a fine-grained manner. The optimization is produced by pipelining the subtasks and dispatching each of them onto well-selected resources. Two types of scheduling algorithms are discussed and customized to adapt the characteristics of parameter-sweep, as well as their effectiveness has been compared under multifarious scenarios.
We present an algorithm for scheduling distributed data intensive bag-of-task applications on data grids that have costs associated with requesting, transferring and processing datasets. We evaluate the algorithm on a...
详细信息
ISBN:
(纸本)9780780390379
We present an algorithm for scheduling distributed data intensive bag-of-task applications on data grids that have costs associated with requesting, transferring and processing datasets. We evaluate the algorithm on a data grid testbed and present the results.
Grid and peer-to-peer (P2P) network technologies enable aggregation of distributed resources for solving large-scale and computationally-intensive applications. These technologies are well-suited for bag-of-tasks (BoT...
详细信息
Grid and peer-to-peer (P2P) network technologies enable aggregation of distributed resources for solving large-scale and computationally-intensive applications. These technologies are well-suited for bag-of-tasks (BoT) applications, because each application consists of many parallel and independent tasks. With multiple users competing for the same resources, the key challenge is to finish a user application within a specified deadline. In this paper, we propose a time optimization algorithm that schedules a user application on auction-based resource allocation systems. These allocation systems, which are based on proportional share, allow users to bid higher in order to gain more resource shares. Therefore, this algorithm adjusts a user bid periodically on these systems in order to finish the application on time.
Over the last few years, grid technologies have progressed towards a service-oriented paradigm that enables a new way of service provisioning based on utility computing models. Users consume these services based on th...
详细信息
Over the last few years, grid technologies have progressed towards a service-oriented paradigm that enables a new way of service provisioning based on utility computing models. Users consume these services based on their QoS (quality of service) requirements. In such "pay-per-use" grids, workflow execution cost must be considered during scheduling based on users' QoS constraints. In this paper, we propose a cost-based workflow scheduling algorithm that minimizes execution cost while meeting the deadline for delivering results. It can also adapt to the delays of service executions by rescheduling unexecuted tasks. We also attempt to optimally solve the task scheduling problem in branches with several sequential tasks by modeling the branch as a Markov decision process and using the value iteration method
For generations, the academic community has relied on peer review as a way of encouraging scholarship and enhancing the knowledge base. Peer review has been widely used in the classroom since at least the 1970s, with ...
详细信息
ISBN:
(纸本)1581139977
For generations, the academic community has relied on peer review as a way of encouraging scholarship and enhancing the knowledge base. Peer review has been widely used in the classroom since at least the 1970s, with hundreds of papers on its use in diverse academic fields appearing in the literature (for a comprehensive survey, see [1]). Its use appears to be on the upswing, given the current interest in active learning and teamwork. In computer science, peer review seems to have very broad application. It can be used to evaluate the contributions of various members to a project team;it can be used for design documents and code reviews, in writing assignments, and in capstone project courses. The experience of the panelists is illustrative of the wide range of peer-review practices. This panel will serve to introduce the audience to some of these applications. Since many computer-science instructors have experimented with peer review, we are anxious to have them share their experiences during the open discussion period.
This research proposes to modernize a legacy software system by using Web services as the main building blocks of the software reengineering. For this purpose, a legacy theorem proof checking and derivation tool calle...
详细信息
This research proposes to modernize a legacy software system by using Web services as the main building blocks of the software reengineering. For this purpose, a legacy theorem proof checking and derivation tool called Bertie3 is reengineered in terms of service-oriented architecture, service-oriented componentization, and external data representation and serialization. With the Web services of derivation checking engines and first-order markup languages, a minimal amount of development time can be spent working on well-known and well-developed components. More time can be spent updating the features that make the tool unique. This case study shows that modernizing a software system with Web services will allow the business components of the system to be easily expanded and integrated with other application components for future demands.
Peer-to-Peer (P2P) computing is said to be the next wave of computing after client-server and web-based computing. It provides an opportunity to harness a lot of idle peer-resources such as desktop computers across th...
详细信息
Managing a large software project involves initial estimates that may turn out to be erroneous or that might be expressed with some degree of uncertainty. Furthermore, as the project progresses, it often becomes neces...
详细信息
Managing a large software project involves initial estimates that may turn out to be erroneous or that might be expressed with some degree of uncertainty. Furthermore, as the project progresses, it often becomes necessary to rework some of the work packages that make up the overall project. Other work packages might have to be abandoned for a variety of reasons. In the presence of these difficulties, optimal allocation of staff to project teams and teams to work packages is far from trivial. This paper shows how genetic algorithms can be combined with a queuing simulation model to address these problems in a robust manner. A tandem genetic algorithm is used to search for the best sequence in which to process work packages and the best allocation of staff to project teams. The simulation model, that computes the project estimated completion date, guides the search. The possible impact of rework, abandonment and erroneous or uncertain initial estimates are characterised by separate error distributions. The paper presents results from the application of these techniques to data obtained from a large scale commercial software maintenance project.
One goal for future Mars missions is to navigate a rover to science targets not visible to the rover, but seen in orbital or descent images. In order to support and improve long-range navigation capabilities, we gener...
详细信息
ISBN:
(纸本)0780381556
One goal for future Mars missions is to navigate a rover to science targets not visible to the rover, but seen in orbital or descent images. In order to support and improve long-range navigation capabilities, we generate 3D terrain maps using all available images, including surface images from the lander and/or rover, descent images from the lander, and orbital images from current and future Mars orbiters. The techniques used include wide-baseline stereo mapping for terrain distant from the rover, bundle adjustment for high-accuracy mapping of surface images, and structure-from-motion techniques for mapping using descent and orbital images. The terrain maps are compiled using a system for unifying multi-resolution models and integrating three-dimensional terrains.
暂无评论