Filters








204,807 Hits in 1.9 sec

Bounds on scheduling with limited resources

M. R. Garey, R. L. Grehem
1973 ACM SIGOPS Operating Systems Review  
The introduction of limited resources into scheduling problems of this type was first suggested by E. Arthurs.  ...  Thus, the addition of limited resources into the standard model causes an increase in the worst-case behavior bounds, as might be expected.  ... 
doi:10.1145/957195.808057 fatcat:bzso7idwozdcffbxbpfspsox7q

Cyclic Scheduling of Flexible Job-shop with Time Window Constraints and Resource Capacity Constraints

Hongchang Zhang, Simon Collart-Dutilleul, Khaled Mesghouni
2015 IFAC-PapersOnLine  
This paper deals with the cyclic scheduling of flexible job-shop with time window constraints and resource capacity constraints.  ...  Abstract: This paper deals with the cyclic scheduling of flexible job-shop with time window constraints and resource capacity constraints.  ...  The transferring time from one machine to another one is considered as bounded time window with lower bound and upper bound. The processing machines are seen as machine resources.  ... 
doi:10.1016/j.ifacol.2015.06.184 fatcat:jecpbxntfna3lnivtmnlu4pzu4

A Branch And Bound Algorithm For Resource Constrained Project Scheduling Problem Subject To Cumulative Resources

A. Shirzadeh Chaleshtari, Sh. Shadrokh
2012 Zenodo  
However, although cumulative resources are widespread in practical cases, the literature on project scheduling problems subject to these resources is scant.  ...  So in order to study this type of resources more, in this paper we use the framework of a resource constrained project scheduling problem (RCPSP) with finish-start precedence relations between activities  ...  In case a tie happens when more than one node exist in the set with maximum number of scheduled activities, the jump-tracking rule is used and one node is selected with the lower amount of lower bound  ... 
doi:10.5281/zenodo.1060863 fatcat:wufe63fitbcplagzqzlgk2abpy

Enhanced Algorithms for Multi-site Scheduling [chapter]

Carsten Ernemann, Volker Hamscher, Achim Streit, Ramin Yahyapour
2002 Lecture Notes in Computer Science  
To this end, several machine configurations have been simulated with different parallel job workloads which were extracted from real traces.  ...  The adaptive multi-site scheduling uses a simple decision rule whether to use or not to use multi-site scheduling.  ...  therefore all jobs with the same resource consumption have the same influence on the schedule quality.  ... 
doi:10.1007/3-540-36133-2_20 fatcat:4gmvn4jxfrgexh3ex7wg3zavui

Response Time versus Utilization in Scheduler Overhead Accounting

Silviu S. Craciunas, Christoph M. Kirsch, Ana Sokolova
2010 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium  
Both methods can be combined by handling an arbitrary fraction of the total scheduler overhead with one method and the rest with the other.  ...  Although our analysis is based on the VBS model, the general idea of response and utilization accounting may also be applied to other, related scheduling methods.  ...  The virtual periodic resource R is a pair R = (λ, π) of natural numbers with λ ≤ π, where λ denotes the limit and π the period of the resource.  ... 
doi:10.1109/rtas.2010.14 dblp:conf/rtas/CraciunasKS10 fatcat:fzifh5gfpjbvlgd755mlk36gle

Resource Tardiness Weighted Cost Minimization in Project Scheduling

Ali Shirzadeh Chaleshtari
2017 Advances in Operations Research  
In this paper, we study a project scheduling problem that is called resource constrained project scheduling problem under minimization of total weighted resource tardiness penalty cost (RCPSP-TWRTPC).  ...  In this problem, the project is subject to renewable resources, each renewable resource is available for limited time periods during the project life cycle, and keeping the resource for each extra period  ...  If a tie happens, three rules are used in respective order until one single node is chosen, including selecting a node with the most scheduled activities, a node with the least associated lower bound,  ... 
doi:10.1155/2017/1308704 fatcat:bvgyym5cxza37dupcqzizjtwxa

Characterizing Fine-Grained Resource Utilization for Multitasking GPGPU in Cloud Systems

Kyungwoon Cho, Hyokyung Bahn
2021 IEEE Access  
Managing GPGPU resources in cloud systems is challenging as workloads with various resource usage patterns coexist.  ...  Specifically, we anatomize the characteristics of various GPGPU workloads and present a new scheduling policy that aims at balancing resource utilization by co-locating workloads with complementary resource  ...  As we increase the load on the GPGPU up to its resource limit, either a computing or a memory resource usually becomes the performance bottleneck.  ... 
doi:10.1109/access.2021.3132492 fatcat:y5yucr4qbbeevcmwkfpydzrqbe

Special issue on computational tradeoffs under bounded resources

Eric Horvitz, Shlomo Zilberstein
1998 Artificial Intelligence  
with the composition, monitoring, and guidance of inference under limited resources.  ...  area, including flexible computation, anytime algorithms, imprecise computation, design-totime scheduling, memory-bounded search, and resource-bounded reasoning.  ...  with the composition, monitoring, and guidance of inference under limited resources.  ... 
doi:10.1016/s0004-3702(98)00037-x fatcat:hle4wtz4rbgrpe3pupddxupylm

The limited-preemptive feasibility of real-time tasks on uniprocessors

Abhilash Thekkilakattil, Radu Dobrin, Sasikumar Punnekkat
2015 Real-time systems  
Finally, we examine the consequences of having more processors on limited-preemptive feasibility and derive the bound on the number of processors that guarantees a specified limited-preemptive behavior  ...  In this paper, we focus on the characterization of the effects of increasing the computational resources on the limited-preemptive feasibility of real-time tasks in order to quantify the sub-optimality  ...  Acknowledgements We would like to thank Sanjoy Baruah for suggesting the proof of Lemma 6, Jim Anderson for pointing out the relationship between the resource augmentation bound and accuracy of timing  ... 
doi:10.1007/s11241-015-9222-3 fatcat:26b4ddtwfvhk5jlnxgxygimq2q

A Mechanism That Bounds Execution Performance for Process Group for Mitigating CPU Abuse [chapter]

Toshihiro Yamauchi, Takayuki Hara, Hideo Taniguchi
2010 Communications in Computer and Information Science  
In this paper, we propose an improved mechanism that helps to achieve a bound on the execution performance of a process group, in order to limit unnecessary processor usage.  ...  However, CPU resources, which are important resources for executing a program, are not the object of access control.  ...  Execution Resource with Upper Bound Rate-Limiting Mechanism Based on the Use of Execution Resources In existing OSes, whose operation is based on the time-sharing technique, the CPU time used by a process  ... 
doi:10.1007/978-3-642-17610-4_10 fatcat:uoe6gbyzabalrbdphrdmdr65re

Batch efficiency

Ulrich Schwickerath, Ricardo Silva, Christian Uria
2010 Journal of Physics, Conference Series  
As a first step for improvements CERN has launched a project to develop a scheduler add-on that allows careful overloading of worker nodes that run idle jobs.  ...  A frequent source of concern for resource providers is the efficient use of computing resources in their centers. This has a direct impact on requests for new resources.  ...  However, there are limits to this approach, because on the execution nodes disk and memory space and I/O bandwidth are limited as well. These limits become specially visible with multicore machines.  ... 
doi:10.1088/1742-6596/219/7/072052 fatcat:hyep26iuurhynhuofppmswrvcq

Cluster Oriented Optimized Cloud Task Scheduling Strategy using Linear Programming

Mahesh S., Anilkumar Kadam
2015 International Journal of Computer Applications  
Thus to gratify cloud users, CSP must has to schedule cloud resources so that it charges minimum amount to users in return for execution of their tasks on cloud resources.  ...  Cloud computing deals with on demand allocation of remotely placed computing and storage devices to the cloud users on charge per utilization basis.  ...  As shown in results, using the proposed task scheduling strategy, one can minimize charges that user required to pay in return for processing his task on cloud resources within the time limit supplied  ... 
doi:10.5120/ijca2015906620 fatcat:cx6h6ouauzakvdz6fzrpeugtaq

Scheduling in the Face of Uncertain Resource Consumption and Utility [chapter]

Jeremy Frank, Richard Dearden
2003 Lecture Notes in Computer Science  
In these circumstances, we would like to find schedules that exceed a lower bound on the expected utility when executed.  ...  We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known capacity and where the tasks have uncertain utility.  ...  this with tight resource bounds.  ... 
doi:10.1007/978-3-540-45193-8_62 fatcat:35h7cyo2fnawnh76spts77as2m

Upper and lower bounds on subcarrier collision for inter-cell interference scheduler in OFDMA-based systems: Voice traffic

Serhan Yarkan, Koon Hoo Teo, Hüseyin Arslan, Jinyun Zhang, Khalid A. Qaraqe
2010 Physical Communication  
Moreover, the impact of scheduling period on the performance of schedulers is examined. Numerical results are presented along with related discussions.  ...  On the other hand, the lower bound of subcarrier collision for ICI schedulers corresponds to the case which is driven by the perfect knowledge about the reserved resources in the neighboring cell.  ...  However, limiting case does not allow one to find k ϵ + 1 but k ϵ .  ... 
doi:10.1016/j.phycom.2010.05.001 fatcat:4l7t54iclnfgtarohzvc5rg5we

Temporal isolation in real-time systems: the VBS approach

Silviu S. Craciunas, Christoph M. Kirsch, Hannes Payer, Harald Röck, Ana Sokolova
2012 International Journal on Software Tools for Technology Transfer (STTT)  
We present the VBS design, implementation, proofs, and experiments, followed by condensed versions of results on scheduler overhead accounting with VBS and on reducing power consumption in VBS systems.  ...  The test is a sufficient condition for VBS to provide temporal isolation through lower and upper response-time bounds on processes.  ...  The resource reservation concept is extended in [32] to include other system resources with a focus on QoS guarantees.  ... 
doi:10.1007/s10009-012-0246-x fatcat:nskmn7darfhnxlajldlvu24gke
« Previous Showing results 1 — 15 out of 204,807 results