Multithreading Prioritization Concurrently by using an Effective Dynamic Slicing Algorithm

Maysoon, A. Mohammed and Mazlina, Abdul Majid and Mohammed Adam, Ibrahim Fakharaldien and Balsam, A. Mustafa (2014) Multithreading Prioritization Concurrently by using an Effective Dynamic Slicing Algorithm. In: The 3rd International Conference on Computer Engineering and Mathematical Sciences (ICCEMS 2014), 4-5 December 2014 , Langkawi, Kedah. pp. 1-4..


Download (3MB)


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. Dynamic program slicing describes an amount of program slicing techniques that depend on program execution and may even significantly decrease the size of an application slice simply because run-time data, accumulated during program execution, is used in order to figure out system slices. Three related methods to multithreading prioritization are introduced in this paper.

Item Type: Conference or Workshop Item (Speech)
Uncontrolled Keywords: Dynamic slicing; multithreading; prioritization; CPTA
Subjects: Q Science > QA Mathematics > QA76 Computer software
Faculty/Division: Faculty of Computer System And Software Engineering
Depositing User: Mrs. Neng Sury Sulaiman
Date Deposited: 28 Jul 2015 03:29
Last Modified: 25 Oct 2022 00:43
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item