Dynamic Scheduling in Systems with Complex Resource Allocation Requirements
نویسندگان
چکیده
Real world systems can be thought of as structures of activities that require resources in order to execute. Costs are reduced when resource levels are kept low, but this can lead to competition for resources that can cause poor system performance. Careful allocation of resources can improve system performance by enabling more efficient use of resources. This paper proposes that resource scheduling be done in a series of dynamic reschedulings that use precise and detailed information about the system and available resources to improve the quality of scheduling results. Each rescheduling is done over a relatively small set of activities, and a genetic algorithm is used to support scheduling computations. Simulations of healthcare systems are used to evaluate this approach. Results indicate that this approach can support effective dynamic rescheduling at affordable costs.
منابع مشابه
A New Job Scheduling in Data Grid Environment Based on Data and Computational Resource Availability
Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data...
متن کاملA Multi-objective optimization model for project scheduling with time-varying resource requirements and capacities
Proper and realistic scheduling is an important factor of success for every project. In reality, project scheduling often involves several objectives that must be realized simultaneously, and faces numerous uncertainties that may undermine the integrity of the devised schedule. Thus, the manner of dealing with such uncertainties is of particular importance for effective planning. A realistic sc...
متن کاملProfit-oriented resource allocation using online scheduling in flexible heterogeneous networks
In this paper, we discuss a generalized measurement-based adaptive scheduling framework for dynamic resource allocation in flexible heterogeneous networks, in order to ensure efficient service level performance under inherently variable traffic conditions. We formulate our generalized optimization model based on the notion of a “profit center” with an arbitrary number of service classes, nonlin...
متن کاملAdaptive Cache Aware Multiprocessor Scheduling Framework (Research Masters) A THESIS SUBMITTED TO THE FACULTY OF SCIENCE AND TECHNOLOGY OF QUEENSLAND UNIVERSITY OF TECHNOLOGY IN FULFILMENT OF THE REQUIREMENTS FOR THE DEGREE OF RESEARCH MASTER
Computer resource allocation represents a significant challenge particularly for multiprocessor systems, which consist of shared computing resources to be allocated among co-runner processes and threads. While an efficient resource allocation would result in a highly efficient and stable overall multiprocessor system and individual thread performance, ineffective poor resource allocation causes...
متن کاملA Joint Three Compensation round based scheduling Algorithm and a dynamic resource allocation procedure for OFDMA Cognitive systems
In this paper we propose a three compensation round based scheduling algorithm and a dynamic resource allocation procedure for OFDMA based cognitive radio. The main contribution of the proposed scheduling scheme is a high interaction with the external environment, to insure on one hand fairness guarantee between the different real time traffic queues and on the other hand, an enhancement in the...
متن کامل