Results 211 to 220 of about 50,399 (258)
Some of the next articles are maybe not open access.
SCHEDULING AND MANAGEMENT OF VIRTUAL RESOURCES IN GRID SITES: THE SITE RESOURCE SCHEDULER
Parallel Processing Letters, 2009This paper presents a new approach to resource management and scheduling in computational grids, in order to simplify the vision users have from grid resources and their management. Scheduling decisions are moved to the site where resources are hosted, allowing quick response to changes in load and resource availability.
Rodrigo N. Calheiros +2 more
openaire +2 more sources
Fuel Resource Scheduling The Daily Scheduling Problem
IEEE Transactions on Power Apparatus and Systems, 1985The paper presents different network flow algorithms to handle the linear and nonlinear unit I/O characteristics of the daily fuel scheduling problem with hourly and daily fuel constraints. Results of a 17 unit/17 contract test system results are presented to illustrate the highlights of the proposed methodologies.
S. Vemuri +2 more
openaire +1 more source
Cooperative scheduling of multiple resources
Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054), 2003Obtaining simultaneous and timely access to multiple resources is known to be an NP-complete problem. Complete resource decoupling is, therefore, often used for managing end-to-end delays in distributed real-time system where each processor is scheduled independent of the others. This decoupling approach unfortunately fails when multiple resources must
Saowanee Saewong, Ragunathan Rajkumar
openaire +1 more source
Wasted resources in gang scheduling
Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology', 2002Gang scheduling (the scheduling of a number of interacting threads to run simultaneously on distinct processors) can leave processors idle if the sizes of the gangs do not match the number of available processors. Given an optimal offline algorithm it is shown that the wasted processing power can range from 0% to 50%, depending on the distribution of ...
Dror G. Feitelson, Larry Rudolph
openaire +1 more source
Task-resource scheduling problem
International Journal of Automation and Computing, 2012Cloud computing is a new and rapidly emerging computing paradigm where applications, data and IT services are provided over the Internet. The task-resource management is the key role in cloud computing systems. Task-resource scheduling problems are premier which relate to the efficiency of the whole cloud computing facilities.
Anna A. Gorbenko, Vladimir Yu. Popov
openaire +2 more sources
Scheduling-free resource management
Data & Knowledge Engineering, 2007We investigate a resource management policy that allocates resources based on the number of available resources only. We formulate a condition on resource requesting processes, called solidity that guarantees successful termination. Processes that do not satisfy this condition can be modified to become solid.
Kees M. van Hee +4 more
openaire +2 more sources
Scheduling Resources for Throughput Maximization
2011We consider the problem of scheduling a set of resources over time. Each resource is specified by a set of time intervals (and the associated amount of resource available), and we can choose to schedule it in one of these intervals. The goal is to maximize the number of demands satisfied, where each demand is an interval with a starting and ending time,
Venkatesan T. Chakaravarthy +4 more
openaire +1 more source
Temporal resource scheduling equity
2016 11th International Conference for Internet Technology and Secured Transactions (ICITST), 2016This paper examines the process used in scheduling limited resources for blocks of time. The paper compares a complex algorithm current used to a random assignment system on scheduling equity. This research involved scheduling contracted guides with non-regular schedules to tours in advance or the day of the scheduling process.
Madeline Little, Aspen Olmsted
openaire +1 more source
1997
During the time analysis we obtained the early and late start and finish times of the activities. During these procedures no resources were assigned to the activities. However, in the practice the completion of individual tasks requires different resources, e.g., manpower, machines and materials.
openaire +1 more source
During the time analysis we obtained the early and late start and finish times of the activities. During these procedures no resources were assigned to the activities. However, in the practice the completion of individual tasks requires different resources, e.g., manpower, machines and materials.
openaire +1 more source
Bounds on scheduling with limited resources
ACM SIGOPS Operating Systems Review, 1973A number of authors (of. [12],[6], [7],[3],[11],[4],[5],[9]) have recently been concerned with scheduling problems associated with a certain model of an abstract multiprocessing system (to be described in the next section) and, in particular, with bounds on the worst-case behavior of this system as a function of the way in which the inputs are allowed ...
M. R. Garey, Ronald L. Graham
openaire +1 more source