Multithreading Prioritization Concurrently by using an Effective Dynamic Slicing Algorithm
Lately, multithreading evolved into a standard way to enhance the processor usage and program efficiency. The dynamic program slice can be that component of an application that affects the working out of an adjustable regarding interest throughout program performance over a certain system input. Dyn...
Main Authors: | Maysoon, A. Mohammed, Mazlina, Abdul Majid, Mohammed Adam, Ibrahim Fakharaldien, Balsam, A. Mustafa |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/8629/ http://umpir.ump.edu.my/id/eprint/8629/1/Multithreading_Prioritization_Concurrently_by_using_an_Effective_Dynamic_Slicing_Algorithm.pdf |
Similar Items
-
A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm
by: Mohammed, Maysoon A., et al.
Published: (2016) -
Queueing Theory Study of Round Robin Versus Priority Dynamic Quantum Time Round Robin Scheduling Algorithms
by: Maysoon, A. Mohammed, et al.
Published: (2015) -
An Experimental Design to Compare Software Requirements Prioritization Techniques
by: Balsam, A. Mustafa, et al.
Published: (2014) -
Handling Constraints in Combinatorial Interaction Testing in the Presence of Multi Objective Particle Swarm and Multithreading
by: Ahmed, Bestoun S., et al.
Published: (2017) -
Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms
by: Mohammed, Maysoon A., et al.
Published: (2016)