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. © 2011 Springer-Verlag.