Results 261 to 270 of about 79,637 (307)
Some of the next articles are maybe not open access.
Proceedings of the 1988 ACM sixteenth annual conference on Computer science - CSC '88, 1988
Interprocess interactions in concurrent programs serve two major functions: conditional exclusion and scheduling. This article presents high-level techniques for specification of scheduling policies, and for proving the starvation-free property of scheduling policies after they are formally specified.
Chyuan Samuel Hsieh, Elizabeth A. Unger
openaire +1 more source
Interprocess interactions in concurrent programs serve two major functions: conditional exclusion and scheduling. This article presents high-level techniques for specification of scheduling policies, and for proving the starvation-free property of scheduling policies after they are formally specified.
Chyuan Samuel Hsieh, Elizabeth A. Unger
openaire +1 more source
Scheduling and Resource Allocation
2015Chap.8 SCHEDULING AND RESOURCE ALLOCATION - 8.1 Introduction: Energy-Aware Scheduling 8.2 Use of Linear Programming in Energy-Aware Scheduling 8.2.1 Finding the Optimal Solution Using a Linear Program 8.2.2 Benefits and Limitations of LP 8.3 Heuristics in Large Instances 8.3.1 Energy-Aware Greedy Algorithms 8.3.2 Vector Packing 8.3.3 Improving Fast ...
Agrawal, Pragati +9 more
openaire +3 more sources
European Journal of Operational Research, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
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
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
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
Scheduling and Resource Allocation in 802.11ax
IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, 2018802.11ax introduces OFDMA to WiFi. It thus enables multiplexing users/user groups in the frequency domain. WiFi networks usually operate in a multipath environment which generates a frequency selective channel. Hence, the capacity of a user/user group changes over different subcarriers.
Kaidong Wang, Konstantinos Psounis
openaire +1 more source