Task scheduling algorithms have consistently been the foundation of parallel testing technology, particularly in the domain of control systems. The complexity of testing tasks in these systems presents a significant c...
详细信息
Adopting Ahead-of-Time (AOT) compilation to improve a programming language's performance shows significant gains in execution time during consecutive program executions. However, such gains come at the cost of spe...
详细信息
Packet loss rate and end to end delay are parameters due to which end users can't achieve better data services especially in wireless mobile communication system. Packet loss rate occurs due to losses, interferenc...
详细信息
The virtualization technology is helpful to support grid QoS. A manual configuration method and an automatic configuration method are designed to build the virtual workspace environment based on virtualization technol...
详细信息
In this paper, we consider an interesting generalization of the classic job scheduling problem in which each job needs to compete for not only machines but also other types of resources. The contentions among jobs for...
详细信息
ISBN:
(纸本)3540241310
In this paper, we consider an interesting generalization of the classic job scheduling problem in which each job needs to compete for not only machines but also other types of resources. The contentions among jobs for machines and resources could interfere with each other, which complicates the problem dramatically. We present a family of approximation algorithms for solving several variants of the problem by using a generic algorithmic framework. Our algorithms achieve a constant approximation ratio (i.e., 3) if there is only one type of resources or certain dependency relation exists among multiple types of resources. For the case that r unrelated resources are given, the approximation ratio of our algorithm becomes k + 2, where k less than or equal to r is a constant depending on the problem instance. As an application, we also show that our techniques can be easily applied to optical burst switching (OBS) networks for deriving more efficient wavelength scheduling algorithms.
The cloud environment is a collection of resources providing multiple services to the end-users. Users submit tasks to this cloud computing environ ment for computation purposes. Using statically fixed resource schedu...
详细信息
In this paper, the grid computing environment resource reservation problem of using the parallel machine, proposed the relaxed time parallel scheduling models and algorithms support resource reservation. The simulatio...
详细信息
The drive to decarbonize the power grid to slow the pace of climate change has caused dramatic variation in the cost, availability, and carbon-intensity of power. This has begun to shape the planning and operation of ...
详细信息
Data broadcasting has been recognized as a very effective data delivery mechanism in mobile computing environments with an unlimited number of users and changing demand patterns. A fundamental server design issue is t...
详细信息
ISBN:
(纸本)1601320914
Data broadcasting has been recognized as a very effective data delivery mechanism in mobile computing environments with an unlimited number of users and changing demand patterns. A fundamental server design issue is the scheduling algorithm needed for the construction of the broadcast program. In most situations, users require information before a certain time, and therefore the server scheduling algorithm should consider the existence of timing constraints. In this paper we analyse the theoretical lower bound for deadlines missed in strong server overload conditions. Considering the results of the theoretical analysis, this paper compares two recent scheduling algorithms, pull-based SIN? and hybrid (push-pull) AHB, both proved to perform efficiently in asymmetric time-constrained communication environments in which the user access distribution is dynamic. Performance is evaluated by simulation.
NASA researchers are developing surface optimization algorithms and a concept of operations for an airport surface traffic management tool called Spot And Runway Departure Advisor (SARDA). As part of this research, th...
详细信息
ISBN:
(数字)9781624102257
ISBN:
(纸本)9781624102257
NASA researchers are developing surface optimization algorithms and a concept of operations for an airport surface traffic management tool called Spot And Runway Departure Advisor (SARDA). As part of this research, the SARDA scheduling algorithms have been adapted to work at several capacity-constrained airports. Adapting the SARDA scheduling algorithms to airports with dissimilar geometries and operational characteristics requires a careful study of the trade-offs between competing optimization objectives and conflicting constraints. This paper presents three trade-off studies, which were performed using a fast-time simulation of the Charlotte Douglas International airport (CLT). The first study explores a trade-off between minimizing system-wide delay and allocating delay equitably among flights. The equitable delay allocation objective was achieved through a simple scheduler formulation modification. The second study focuses on a tradeoff between minimizing system-wide delay and employing an aggressive gate holding strategy. The scheduler's gate holding strategy was managed by adding a new departure queue duration scheduling parameter to control how long departures are allowed to wait in the runway queue. The third study explores the effectiveness of controlling how aircraft merge together in the ramp area in order to achieve a departure sequence which maximizes throughput. This study was motivated by CLT's distinctive airport geometry, which forces departures to merge together in the ramp area to form departure sequences prior to reaching the runway. The paper describes and summarizes the results of these three studies.
暂无评论