7,902 Hits in 6.2 sec

Elastic Scheduling of Parallel Real-Time Tasks with Discrete Utilizations

James Orr, Johnny Condori Uribe, Chris Gill, Sanjoy Baruah, Kunal Agrawal, Shirley Dyke, Arun Prakash, Iain Bate, Christopher Wong, Sabina Adhikari
2020 Proceedings of the 28th International Conference on Real-Time Networks and Systems  
Elastic scheduling allows for online adaptation of real-time tasks' utilizations (via manipulation of each task's computational workload or period) in order to maintain system schedulability in case the  ...  This paper provides a new elastic task model in which each task has a discrete set of possible utilizations (instead of a continuous range).  ...  We use the real-world example of real-time hybrid simulation as a motivating application domain with discretely computationallyelastic, period-elastic, and combined-elastic parallel real-time tasks under  ... 
doi:10.1145/3394810.3394824 dblp:conf/rtns/OrrUGBADPBWA20 fatcat:s4utxmmwabavdayvmbryrkptaq

Don't cry over spilled records: Memory elasticity of data-parallel applications and its application to cluster scheduling [article]

Calin Iorgulescu, Florin Dinu, Aunn Raza, Wajih Ul Hassan, Willy Zwaenepoel
2017 arXiv   pre-print
Tasks may complete faster when scheduled with less memory because their waiting time is reduced.  ...  We show that a scheduler can turn this task-level trade-off into improved job completion time and cluster-wide memory utilization. We have integrated memory elasticity into Apache YARN.  ...  Simulation Methodology Simulator We built DSS (Discrete Scheduler Simulator) a discrete-time simulator for YARN and we made the code publicly available 1 .  ... 
arXiv:1702.04323v1 fatcat:yuounnaujjgwzgt5b2f6yzisqi

Cost optimized provisioning of elastic resources for application workflows

Eun-Kyu Byun, Yang-Suk Kee, Jin-Soo Kim, Seungryoul Maeng
2011 Future generations computer systems  
The experimental results with a number of synthetic workflows and several real science workflows demonstrate that PBTS estimates the resource capacity close to the theoretical low bound.  ...  Especially, we focus on its core algorithm named PBTS (Partitioned Balanced Time Scheduling), which estimates the minimum number of computing hosts required to execute a workflow within a user-specified  ...  We use the same computing platform model used in our prior study [15, 16] except that resources are elastic with a discrete lease period.  ... 
doi:10.1016/j.future.2011.05.001 fatcat:zifyddwv2fagrhmbgtongjjebi

Elastic Resource Provisioning for Batched Stream Processing System in Container Cloud [chapter]

Song Wu, Xingjun Wang, Hai Jin, Haibao Chen
2017 Lecture Notes in Computer Science  
Recently, batched stream processing systems tend to be deployed in cloud due to their requirement of elasticity and cost efficiency.  ...  On the other hand, it conducts resource scheduling in cluster according to the workload distribution.  ...  [3] propose a resource scheduler which dynamically allocates processors to operators to ensure real-time response.  ... 
doi:10.1007/978-3-319-63579-8_32 fatcat:72m5f4obpbaoljvy3alrhdbaqq

Adaptive TDMA bus allocation and elastic scheduling: A unified approach for enhancing robustness in multi-core RT systems

Paolo Burgio, Martino Ruggiero, Francesco Esposito, Mauro Marinoni, Giorgio Buttazzo, Luca Benini
2010 2010 IEEE International Conference on Computer Design  
Among these, elastic scheduling has been proved to provide satisfactory results by dynamically reducing task periods at run-time to ensure the highest utilization possible of the processors.  ...  Next-generation real-time systems will be increasingly based on heterogeneous MPSoC design paradigms, where predictability and performance will be key issues to deal with.  ...  The authors would also like to acknowledge the support of ArtistDesign European Network of Excellence.  ... 
doi:10.1109/iccd.2010.5647792 dblp:conf/iccd/BurgioREMBB10 fatcat:gghtq5cldvfezgirmj5yjal5l4

Fault Tolerant Scheduling Methods in Cloud Based 5G Networks

The main idea of fault tolerant scheduling methods is to involve redundancy , so that all the tasks can be performed even when the system fails.  ...  Hence various scheduling algorithms can be used to overcome this problem. In this paper, the different kinds of fault tolerant scheduling algorithms are discussed.  ...  Hence , the author proposes a partitioned scheduling algorithm for the real time tasks called as Wi-EDF.  ... 
doi:10.35940/ijitee.i8955.0881019 fatcat:lf6rsmvr7rfgtlhfpb7pdgtnma


2014 American Journal of Applied Sciences  
Based on these basic requirements, need of higher computational resources is an important issue when dealing with current technological methodology.  ...  These requirements are very common in an organization while dealing with current technological data and requirements.  ...  Hence, a novel Turnaround time utility scheduling approach with high priority and low priority tasks.  ... 
doi:10.3844/ajassp.2014.1224.1228 fatcat:a735kermjrbspd4hupkx3zpebu

Analysis of Federated Scheduling for Integer-Valued Workloads

Marion Sudvarg, Chris Gill
2022 Proceedings of the 30th International Conference on Real-Time Networks and Systems  
In federated scheduling of parallel real-time tasks on multiprocessor systems, high-utilization tasks are allocated dedicated processors on which they execute exclusively.  ...  The second method exploits the DAG structure of high-utilization tasks, providing a potentially better schedule in pseudo-polynomial time.  ...  Thanks also to Sanjoy Baruah and Abhishek Singh for sharing their wealth of knowledge in the state-of-the-art.  ... 
doi:10.1145/3534879.3534892 fatcat:ssqzuf2nbbcrxgv2t3kwove6ja

Performance and cost evaluation of Gang Scheduling in a Cloud Computing system with job migrations and starvation handling

Ioannis A. Moschakis, Helen D. Karatza
2011 2011 IEEE Symposium on Computers and Communications (ISCC)  
Gang Scheduling is an efficient technique for scheduling parallel jobs, already applied in the areas of Grid and Cluster computing.  ...  This paper studies the application of Gang Scheduling on a Cloud Computing model, based on the architecture of the Amazon Elastic Compute Cloud (EC2).  ...  In our model, degrees of parallelism are random numbers that follow the discrete uniform distribution and fall under two categories of size: 1) Low-Parallelism Jobs, with job sizes in the range [1 . .  ... 
doi:10.1109/iscc.2011.5983873 dblp:conf/iscc/MoschakisK11 fatcat:tu55lcw42rf57l42vch5rexnd4

Evaluation of FPGA Partitioning Schemes for Time and Space Sharing of Heterogeneous Tasks [chapter]

Umar Ibrahim Minhas, Roger Woods, Georgios Karakonstantis
2019 Lecture Notes in Computer Science  
To achieve this, the simulator allows scheduling of large task queues with varying execution times to estimate average system speedup.  ...  Furthermore, along with the help of an exhaustive simulator, the DSE allows us to gauge the effect on system speedup for various PRR optimizations of runtime scheduling using real HPC tasks.  ... 
doi:10.1007/978-3-030-17227-5_24 fatcat:ca7p34amo5fqvfpt3pwozpniya

Elastic Scheduling of Scientific Workflows under Deadline Constraints in Cloud Computing Environments

Nazia Anwar, Huifang Deng
2018 Future Internet  
This paper proposes a strategy, Dynamic Scheduling of Bag of Tasks based workflows (DSB), for scheduling scientific workflows with the aim to minimize financial cost of leasing Virtual Machines (VMs) under  ...  The proposed model groups the workflow into Bag of Tasks (BoTs) based on data dependency and priority constraints and thereafter optimizes the allocation and scheduling of BoTs on elastic, heterogeneous  ...  Tasks in a BoT can be scheduled one by one to an elastic number of VMs for parallel, or serial executions.  ... 
doi:10.3390/fi10010005 fatcat:6nwnv352hfdn3hcbifodthux54

NetworkCloudSim: Modelling Parallel Applications in Cloud Simulations

S. K. Garg, R. Buyya
2011 2011 Fourth IEEE International Conference on Utility and Cloud Computing  
To fill this gap, we have extended a popular Cloud simulator (CloudSim) with a scalable network and generalized application model, which allows more accurate evaluation of scheduling and resource provisioning  ...  Due to the scale and complexity of shared resources, it is often hard to analyze the performance of new scheduling and provisioning algorithms on actual Cloud testbeds.  ...  ACKNOWLEDGMENTS The authors would like to thank Anton Beloglazov, Rodrigo Calheiros, Ruppa Thulasiram and Parimala Thulasiraman for their guidance during the development of NetworkCloudSim reported in  ... 
doi:10.1109/ucc.2011.24 dblp:conf/ucc/GargB11 fatcat:nqznshfprrhdbjuygtnbly7rz4

A Testing Engine for High-Performance and Cost-Effective Workflow Execution in the Cloud

V.K. Pallipuram, T. Estrada, M. Taufer
2015 2015 44th International Conference on Parallel Processing  
Our empirical results show that the pairing of the resource-selection heuristic with AO scheduling policy is a powerful method for cost-effective DAGstructured workflow execution in the cloud.  ...  The testing engine ensures the realism of these assessments by modeling the performance variability of the cloud platform using real traces.  ...  The code of the testing engine and the traces are available on github:  ... 
doi:10.1109/icpp.2015.94 dblp:conf/icpp/PallipuramET15 fatcat:dkzwakicvzagvpl2mewxzk365u

Towards Understanding Uncertainty in Cloud Computing Resource Provisioning

Andrei Tchernykh, Uwe Schwiegelsohn, Vassil Alexandrov, El-ghazali Talbi
2015 Procedia Computer Science  
Table 1 describes some of them and briefly explain their impact on service provisioning: dynamic elasticity, dynamic performance changing, virtualization with loosely coupling applications to the infrastructure  ...  Elasticity has a higher repercussion on the quality of service, but adds a new factor of uncertainty.  ...  Resource Provisioning A key dimension of scheduling policies concerns with how to map a set of tasks to a set of resources. Typically, there are two ways: static scheduling and dynamic scheduling.  ... 
doi:10.1016/j.procs.2015.05.387 fatcat:slgh4s5c75efrgkprepjpkcqdq

Data-Aware Resource Scheduling for Multicloud Workflows: A Fine-Grained Simulation Approach

Wei Tang, Jonathan Jenkins, Folker Meyer, Robert Ross, Rajkumar Kettimuthu, Linda Winkler, Xi Yang, Thomas Lehman, Narayan Desai
2014 2014 IEEE 6th International Conference on Cloud Computing Technology and Science  
However, resource management challenges exist in the elastic cloud environment, such as resource provisioning and task allocation, especially when data movement between multiple domains plays an important  ...  In this work, we study the impact of data-aware resource management and scheduling on scientific workflows in multicloud environments.  ...  Department of Energy, Office of Science, under Contract DE-AC02-06CH11357.  ... 
doi:10.1109/cloudcom.2014.19 dblp:conf/cloudcom/TangJMRKWYLD14 fatcat:tma42lfk5vfc7haxlvcdfv7vr4
« Previous Showing results 1 — 15 out of 7,902 results