The Experts below are selected from a list of 1503 Experts worldwide ranked by ideXlab platform
United Arab Emirates - One of the best experts on this subject based on the ideXlab platform.
-
Nearest Neighbor Affinity Scheduling In Heterogeneous Multi- Core Architectures
2015Co-Authors: Fadi N. Sibai, Al Ain, United Arab EmiratesAbstract:Asymmetric or heterogeneous multi-core (AMC) architectures have definite performance, performance per watt and fault tolerance advantages for a wide range of workloads. We propose a 16 core AMC architecture mixing simple and complex cores, and single and multiple Thread cores of various power envelopes. A Priority-based Thread scheduling algorithm is also proposed for this AMC architecture. Fairness of this scheduling algorithm vis-a-vis lower Priority Thread starvation, and hardware and software requirements needed to implement this algorithm are addressed. We illustrate how this algorithm operates by a Thread scheduling example. The produced schedule maximizes throughput (but is Priority-based) and the core utilization given the available resources, the states and contents of the starting queues, and the Threads ’ core requirement constraints. A simulation model simulates 6 scheduling algorithms which vary in their support of core affinity and Thread migration. The simulation results that both core affinity and Thread migration positively effect the completion time and that the nearest neighbor scheduling algorithm outperforms or is competitive with the other algorithms in all considered scenario
Sibai, Fadi N. - One of the best experts on this subject based on the ideXlab platform.
-
Nearest neighbor affinity scheduling in heterogeneous multi-core architectures
2009Co-Authors: Sibai, Fadi N.Abstract:Asymmetric or heterogeneous multi-core (AMC) architectures have definite performance, performance per watt and fault tolerance advantages for a wide range of workloads. We propose a 16 core AMC architecture mixing simple and complex cores, and single and multiple Thread cores of various power envelopes. A Priority-based Thread scheduling algorithm is also proposed for this AMC architecture. Fairness of this scheduling algorithm vis-a-vis lower Priority Thread starvation, and hardware and software requirements needed to implement this algorithm are addressed. We illustrate how this algorithm operates by a Thread scheduling example. The produced schedule maximizes throughput (but is Priority-based) and the core utilization given the available resources, the states and contents of the starting queues, and the Threads' core requirement constraints. A simulation model simulates 6 scheduling algorithms which vary in their support of core affinity and Thread migration. The simulation results that both core affinity and Thread migration positively effect the completion time and that the nearest neighbor scheduling algorithm outperforms or is competitive with the other algorithms in all considered scenariosFacultad de Informátic
Fadi N. Sibai - One of the best experts on this subject based on the ideXlab platform.
-
Nearest Neighbor Affinity Scheduling In Heterogeneous Multi- Core Architectures
2015Co-Authors: Fadi N. Sibai, Al Ain, United Arab EmiratesAbstract:Asymmetric or heterogeneous multi-core (AMC) architectures have definite performance, performance per watt and fault tolerance advantages for a wide range of workloads. We propose a 16 core AMC architecture mixing simple and complex cores, and single and multiple Thread cores of various power envelopes. A Priority-based Thread scheduling algorithm is also proposed for this AMC architecture. Fairness of this scheduling algorithm vis-a-vis lower Priority Thread starvation, and hardware and software requirements needed to implement this algorithm are addressed. We illustrate how this algorithm operates by a Thread scheduling example. The produced schedule maximizes throughput (but is Priority-based) and the core utilization given the available resources, the states and contents of the starting queues, and the Threads ’ core requirement constraints. A simulation model simulates 6 scheduling algorithms which vary in their support of core affinity and Thread migration. The simulation results that both core affinity and Thread migration positively effect the completion time and that the nearest neighbor scheduling algorithm outperforms or is competitive with the other algorithms in all considered scenario
Al Ain - One of the best experts on this subject based on the ideXlab platform.
-
Nearest Neighbor Affinity Scheduling In Heterogeneous Multi- Core Architectures
2015Co-Authors: Fadi N. Sibai, Al Ain, United Arab EmiratesAbstract:Asymmetric or heterogeneous multi-core (AMC) architectures have definite performance, performance per watt and fault tolerance advantages for a wide range of workloads. We propose a 16 core AMC architecture mixing simple and complex cores, and single and multiple Thread cores of various power envelopes. A Priority-based Thread scheduling algorithm is also proposed for this AMC architecture. Fairness of this scheduling algorithm vis-a-vis lower Priority Thread starvation, and hardware and software requirements needed to implement this algorithm are addressed. We illustrate how this algorithm operates by a Thread scheduling example. The produced schedule maximizes throughput (but is Priority-based) and the core utilization given the available resources, the states and contents of the starting queues, and the Threads ’ core requirement constraints. A simulation model simulates 6 scheduling algorithms which vary in their support of core affinity and Thread migration. The simulation results that both core affinity and Thread migration positively effect the completion time and that the nearest neighbor scheduling algorithm outperforms or is competitive with the other algorithms in all considered scenario
S.s.a. Jafri - One of the best experts on this subject based on the ideXlab platform.
-
avoidance of Priority inversion in real time systems based on resource restoration
International Journal of Computer Science & Applications, 2006Co-Authors: Tarek Helmy, S.s.a. JafriAbstract:Priority inversion is a problem that occurs in concurrent processes when low-Priority Threads hold shared resources required by some high-Priority Threads, causing the high Priority-Threads to block indefinitely. This problem is enlarged when the concurrent processes are in a real time system where high- Priority Threads must be served on time. A novice approach for avoiding the Priority inversion problem is presented for processes in real time systems. This approach is based on backing up and restoring the shared resources. A low Priority Thread always starts on a shadow version of the shared resource, the original resource remains unchanged. When a high-Priority Thread needs a resource engaged by a low-Priority Thread, the low Priority Thread is preempted, the original resource is restored and the high-Priority Thread is allowed to use the original resource. The approach has been implemented in Java and the experimental results are fetched which verify that the approach is very suitable for real time systems where high-Priority Threads must be served on time.