Advance reservation is an important method to guarantee the quality of service in Grid-like distributed systems. However, reserved jobs will make resource into fragments and decrease utilization. In order to minimize ...
详细信息
ISBN:
(纸本)9781479930708
Advance reservation is an important method to guarantee the quality of service in Grid-like distributed systems. However, reserved jobs will make resource into fragments and decrease utilization. In order to minimize the negative effects of advance reservations, the authors analyzed the generation of resource fragments during reservation and investigated their influence on advance reservation requests in a quantitative way. Based on the quantification, two new scheduling algorithms, Resource Fragment-aware Best Fit (FSB) and Resource Fragment-aware Worst Fit (FSW), were proposed and their performances were investigated via comprehensive simulations. In simulation, mean job size, deadline factor, system load and sever number were chosen as control factors, and the performances of the algorithms were analyzed in terms of job acceptance rate, resource utilization and slowdown. We also compared FSB and FSW with Best Fit, First Fit, Min_LIP and Min_TIP. The simulations show that FSW and FSB can provide higher job acceptance rate, especially under heavy system load.
The Elastic Mixed-Criticality (E-MC) task model and an Early-Release EDF (ER-EDF) scheduling algorithm have been studied to address the service interruption problem for low-criticality tasks in uniprocessor systems. I...
详细信息
ISBN:
(纸本)9781479908509
The Elastic Mixed-Criticality (E-MC) task model and an Early-Release EDF (ER-EDF) scheduling algorithm have been studied to address the service interruption problem for low-criticality tasks in uniprocessor systems. In this paper, focusing on multicore systems, we first investigate the schedulability of E-MC tasks under partitioned-EDF (P-EDF) by considering various task-to-core mapping heuristics. Then, with and without task migrations being considered, we study both global and local early-release schemes. Compared to the state-of-the-art Global EDF-VD scheduler, the superior performance of the proposed schemes in terms of improving the service levels of low-criticality tasks is confirmed through extensive simulations.
In future large-scale multi-core microprocessors, hard errors and process variations will create dynamic heterogeneity, causing performance and power characteristics to differ among the cores in an unanticipated manne...
详细信息
ISBN:
(纸本)9781424423972
In future large-scale multi-core microprocessors, hard errors and process variations will create dynamic heterogeneity, causing performance and power characteristics to differ among the cores in an unanticipated manner. Under this scenario, naive assignments of applications to cores degraded by various faults and variations may result in large performance losses and power inefficiencies. We propose scheduling algorithms based on the Hungarian Algorithm and artificial intelligence (AI) search techniques that account for this future uncertainty in core characteristics. These thread assignment policies effectively match the capabilities of each degraded core with the requirements of the applications, achieving an ED2 only 3.2% and 3.7% higher, respectively, than a baseline eight core chip multiprocessor with no degradation, compared to over 22% for a round robin policy.
In this paper we analyse and evaluate several scheduling algorithms that are candidates to support Quality of Service and Service Integration in Sensor and Actuator Networks. They should satisfy two main goals: to gua...
详细信息
ISBN:
(纸本)9781424407255
In this paper we analyse and evaluate several scheduling algorithms that are candidates to support Quality of Service and Service Integration in Sensor and Actuator Networks. They should satisfy two main goals: to guarantee committed delays for time sensitive services, and to improve the network transmission efficiency. The algorithms are described and some results, obtained by simulation, are presented. The proposed Traffic Class Oriented Algorithm proved to be a good solution to meet the proposed objectives as well as to integrate traffic generated by Fieldbus devices and control applications in real communication networks.
In this paper, two scheduling algorithms that solve the problem of efficient scheduling k-strict multithreaded computations are presented. Both of them use the work-stealing technique, in which a processor that doesn&...
详细信息
ISBN:
(纸本)3540620486
In this paper, two scheduling algorithms that solve the problem of efficient scheduling k-strict multithreaded computations are presented. Both of them use the work-stealing technique, in which a processor that doesn't have work to do, steals threads from other processors. Our results achieve linear speedup and linear expansion of memory, for constant k (that is k is an element of O(1)). However, they are general and hold far all values of k.
Desktop Grids are being increasingly used as the execution platform for a variety of applications that can be structured as Bag-of-Tasks (BoT). scheduling BoT applications on Desktop Grids has thus attracted the atten...
详细信息
ISBN:
(纸本)9781424416936
Desktop Grids are being increasingly used as the execution platform for a variety of applications that can be structured as Bag-of-Tasks (BoT). scheduling BoT applications on Desktop Grids has thus attracted the attention of the scientific community, and various schedulers tailored towards them have been proposed in the literature. However previous work has focused on scheduling a single BoT application at a time, thus neglecting other scenarios in which several users submit multiple BoT applications at the same time. This paper aims at filling this gap by proposing a set Of scheduling algorithms able to deal with multiple BoT applications. The performance of these algorithm has been evaluated, by means of simulation, for a large set of operational scenarios obtained by varying both the workload submitted to the Desktop Grid and the characteristics of the involved resources. Our results show that, although there is no a clear winner among the proposed solutions, knowledge-free strategies (that is, strategies that do not require any information concerning the applications or the resources) can provide good performance.
Over the last recent years, applications related to the internet of things have become the most important techniques in the world that facilitate interactions among humans and things to enhance the quality of life. So...
详细信息
Over the last recent years, applications related to the internet of things have become the most important techniques in the world that facilitate interactions among humans and things to enhance the quality of life. So, the number of devices used in these applications will increase, leading to the creation of huge amounts of data. Cisco proposed fog computing in 2012, which located between the end-users (Internet of Things devices) and cloud computing. Fog computing is not a replacement for cloud computing, but it reduces the drawbacks of cloud computing, makes it efficient and provides storage and computing services at the edge of the internet. Resource management is the key factor that decides the performance of fog computing. Whereas scheduling plays an important role in managing resources in fog computing, task scheduling is the ability to map tasks to the appropriate resources in fog computing. The task is a small part of a work that must be performed within a specific time. Because fog computing contains heterogeneous and distributed resources, task scheduling becomes complex. Task scheduling is an NP-hard problem that needs to apply effective task scheduling strategies to reach an ideal solution. There were many proposed algorithms about scheduling in the previous years;most of them were applied in cloud computing, while the minority were applied in fog computing. This paper aims to comprehensively review and analyze the most important up-to-date scheduling algorithms in fog computing. (C) 2021 The Authors. Published by Atlantis Press B.V.
Time-critical requirements of real time systems are provided by software applications running on real time operating systems. These software tasks must be scheduled based on software and hardware events. There are som...
详细信息
ISBN:
(纸本)9781728175652
Time-critical requirements of real time systems are provided by software applications running on real time operating systems. These software tasks must be scheduled based on software and hardware events. There are some services (priority based preemption etc.) in real time operating systems to control software tasks. But in some situations there is a need for scheduling algorithms in real time systems. This need arises especially when time-critical software tasks need to run at different working periods and on a specific timeline. Different scheduling algorithms can be selected to meet the requirements of the system. The flight software that runs on the real-time operating system, especially on satellite platforms, is responsible for time-critical tasks. Main goals of this paper are providing analyze of scheduling algorithms using in real time operating systems, giving the method which is used to apply scheduling algorithms in a real time operating system and providing performance results of these scheduling algorithms obtained as a result of this application. In addition, it is mentioned that which of these algorithms are preferred in space domain.
The optimal allocation of a chain-like task system on the chain-like network computers was first presented by Bokhari with time complexity O(m3n)[1], where m and n denote the number of modules and the number of proces...
详细信息
Shingled recording has recently emerged as one promising candidate to sustain the historical growth of magnetic recording storage areal density. However, since the convenient update-in-place feature is no longer avail...
详细信息
暂无评论