Fuzzy-Based Gang Scheduling Approach for Multiprocessor Systems

Author(s):  
K. M. Al-Aubidy ◽  
K. Batiha ◽  
H. Y. Al-Kharbshh
2009 ◽  
Vol 20 (10) ◽  
pp. 2628-2636 ◽  
Author(s):  
Jian WANG ◽  
Jian-Ling SUN ◽  
Xin-Yu WANG ◽  
Shen-Kang WANG ◽  
Jun-Bo CHEN

2018 ◽  
pp. 47-53
Author(s):  
B. Z. Shmeylin ◽  
E. A. Alekseeva

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