Paper Info
Title
A Concurrent Coloured Petri Nets Model for Solving Binary Search Problem on a Multicore Architecture.
Abstract
Multicore technology has imposed new ways of thinking in the field of software designs. In general, softwares should be adopted to reflect the hardware changes in the design process. Binary Search has its share in these developments, in the sense that this technique should be adaptable with the new environment. In this study, we develop a new hierarchical concurrent model that utilizes concurrent multithreaded scheduling in performing Binary Search on a multicore architecture. A novel algorithm and an enhanced algorithm have been proposed to control the mechanism of the concurrent model. The hierarchical model provides a solution for several weakness points in the previous studies such as overflow, fair distribution, and design complexity. The model has been simulated and verified by using Coloured Petri Nets as a language of modelling and through utilizing CPN-Tool as the modelling tool. The desired results have been reached with no errors or ambiguity.
Year
DOI
Venue
2011
10.1007/978-3-642-22203-0_41
Communications in Computer and Information Science
Keywords
Field
DocType
Divide and Conquer,Multithreading Scheduling,Work Stealing,Concurrency,Binary Search
Petri net,Concurrency,Computer science,Scheduling (computing),Parallel computing,Process architecture,Theoretical computer science,Work stealing,Divide and conquer algorithms,Binary search algorithm,Hierarchical database model
Conference
Volume
ISSN
Citations 
181
1865-0929
0
PageRank 
References 
Authors
0.34
10
2
Name
Order
Citations
PageRank
Alaa M. Al-Obaidi100.34
Sai Peck Lee214222.55