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.
computersystems hosting critical e-commerce applications must typically satisfy stringent quality-of-service (QoS) requirements under dynamic operating conditions and workloads. Also, as such systems increase in size...
详细信息
Evolutionary computation (EC) has been successfully applied to a wide range of design problems. There has also been an abundant amount of work in applying interactive ECs in the design of displays, robot behavior, bit...
详细信息
Continuous audio-visual surveillance is utilized to ensure the physical safety of critical infrastructures such as airports, nuclear power plants and national laboratories. In order to do so, traditional surveillance ...
详细信息
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
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.
We have previously proposed a GSOM-based hybrid model for automatic discovery of ontology, the first step towards semi-automation of ontology construction. One of the shortcomings of this previous model is the use of ...
详细信息
We have previously proposed a GSOM-based hybrid model for automatic discovery of ontology, the first step towards semi-automation of ontology construction. One of the shortcomings of this previous model is the use of a threshold for selecting abstraction levels. The threshold might introduce an inappropriate concept and cause information loss. In this paper, we introduce a new parameter called context ratio (cr) to overcome this drawback. The cr is used as stopping criteria for traversing hypernyms and identifying appropriate abstraction levels. It allows us to extend the previously proposed framework to integrate methodology for multiple inheritance validation in the discovered ontology.
Autonomic computersystems react to changes in the system, including failures, load changes, and changed user behaviour. Autonomic control may be based on a performance model of the system and the software, which impl...
详细信息
Autonomic computersystems react to changes in the system, including failures, load changes, and changed user behaviour. Autonomic control may be based on a performance model of the system and the software, which implies that the model should track changes in the system. A substantial theory of optimal tracking filters has a successful history of application to track parameters while integrating data from a variety of sources, an issue which is also relevant in performance modeling. This work applies extended Kalman filtering to track the parameters of a simple queueing network model, in response to a step change in the parameters. The response of the filter is affected by the way performance measurements are taken, and by the observability of the parameters.
For binary two-state Markov sources, we compute the bit-rate for context-independent Golomb coding, sequential coding, and interleaved coding. We also relate these coding methods to image compression work. Sequential ...
详细信息
For binary two-state Markov sources, we compute the bit-rate for context-independent Golomb coding, sequential coding, and interleaved coding. We also relate these coding methods to image compression work. Sequential coding is a context-dependent method that sequentially codes the source, choosing the order of the elementary Golomb code based on the last bit seen. Interleaved coding codes the even-numbered bits before the odd-numbered bits using elementary Golomb codes of several different orders. Of these methods, we show that no one method is best on all Markov sources.
Feedback control real-time scheduling (FCS) aims at satisfying performance specifications of real-time systems based on adaptive resource management. Existing FCS algorithms often rely on the existence of continuous c...
详细信息
Feedback control real-time scheduling (FCS) aims at satisfying performance specifications of real-time systems based on adaptive resource management. Existing FCS algorithms often rely on the existence of continuous control variables in real-time systems. A number of real-time systems, however, support only a finite set of discrete configurations that limit the adaptation mechanisms. This paper presents hybrid supervisory utilization control (HySUCON) for scheduling such real-time systems. HySUCON enforces processor utilization bounds by managing the switchings between the discrete configurations. Our approach is based on a best-first-search algorithm that is invoked only if reconfiguration is necessary. Theoretical analysis and simulations demonstrate that the approach leads to robust utilization bounds for varying execution times. Experimental results demonstrate the algorithm performance for a representative application scenario.
暂无评论