Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems

Algorithmica ◽  
1996 ◽  
Vol 15 (6) ◽  
pp. 572-599 ◽  
Author(s):  
Yang Cai ◽  
M. C. Kong
Keyword(s):  
Multiprocessor Systems ◽  
Periodic Tasks ◽  
Nonpreemptive Scheduling

Allocating fixed-priority periodic tasks on multiprocessor systems

1995 ◽  
Vol 9 (3) ◽  
pp. 207-239 ◽  
Author(s):  
Yingfeng Oh ◽  
Sang H. Son
Keyword(s):  
Multiprocessor Systems ◽  
Periodic Tasks ◽  
Fixed Priority

Efficient Scheduling Algorithm for Hard Real-Time Tasks in Primary-Backup Based Multiprocessor Systems

2009 ◽  
Vol 20 (10) ◽  
pp. 2628-2636 ◽  
Author(s):  
Jian WANG ◽  
Jian-Ling SUN ◽  
Xin-Yu WANG ◽  
Shen-Kang WANG ◽  
Jun-Bo CHEN
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Multiprocessor Systems ◽  
Hard Real Time

The Research of Measuring Approach and Energy Efficiency for Hadoop Periodic Jobs

2015 ◽  
Vol 8 (1) ◽  
pp. 206-210 ◽  
Author(s):  
Yu Junyang ◽  
Hu Zhigang ◽  
Han Yuanyuan
Keyword(s):  
Energy Efficiency ◽  
Cloud Computing ◽  
Energy Consumption ◽  
Energy Saving ◽  
Energy Estimate ◽  
Cloud Platform ◽  
Periodic Tasks ◽  
Current Consumption ◽  
Reduce Energy Consumption

Current consumption of cloud computing has attracted more and more attention of scholars. The research on Hadoop as a cloud platform and its energy consumption has also received considerable attention from scholars. This paper presents a method to measure the energy consumption of jobs that run on Hadoop, and this method is used to measure the effectiveness of the implementation of periodic tasks on the platform of Hadoop. Combining with the current mainstream of energy estimate formula to conduct further analysis, this paper has reached a conclusion as how to reduce energy consumption of Hadoop by adjusting the split size or using appropriate size of workers (servers). Finally, experiments show the effectiveness of these methods as being energy-saving strategies and verify the feasibility of the methods for the measurement of periodic tasks at the same time.

THE PROBLEM OF PROVIDING CACHE COHERENCE IN MULTIPROCESSOR SYSTEMS WITH MANY PROCESSORS

2018 ◽  
pp. 47-53
Author(s):  
B. Z. Shmeylin ◽  
E. A. Alekseeva
Keyword(s):  
Cache Coherence ◽  
Bloom Filters ◽  
Multiprocessor Systems ◽  
Cache Line ◽  
Maintenance Systems ◽  
Processor Caches ◽  
Conventional Systems ◽  
Additional Hardware

In this paper the tasks of managing the directory in coherence maintenance systems in multiprocessor systems with a large number of processors are solved. In microprocessor systems with a large number of processors (MSLP) the problem of maintaining the coherence of processor caches is significantly complicated. This is due to increased traffic on the memory buses and increased complexity of interprocessor communications. This problem is solved in various ways. In this paper, we propose the use of Bloom filters used to accelerate the determination of an element’s belonging to a certain array. In this article, such filters are used to establish the fact that the processor belongs to some subset of the processors and determine if the processor has a cache line in the set. In the paper, the processes of writing and reading information in the data shared between processors are discussed in detail, as well as the process of data replacement from private caches. The article also shows how the addresses of cache lines and processor numbers are removed from the Bloom filters. The system proposed in this paper allows significantly speeding up the implementation of operations to maintain cache coherence in the MSLP as compared to conventional systems. In terms of performance and additional hardware and software costs, the proposed system is not inferior to the most efficient of similar systems, but on some applications and significantly exceeds them.

Sign in / Sign up

Export Citation Format

Share Document