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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (2000)
Levitin, A.: Introduction to the Design and Analysis of Algorithms. Addison Wesley, Reading (2002)
Dasgupta, S., Papadimitriou, C., Vazirani, U.: Algorithms. McGraw-Hill, New York (2006)
Harris, S., Ross, J.: Beginning Algorithms. Wiley, Chichester (2006)
Kavi, K., Moshtaghi, A., Chen, D.: Modeling Multithreaded Applications Using Petri Nets. International Journal of Parallel Programming 30(5) (October 2002)
Jensen, K., Kristensen, L.: Coloured Petri Nets, Modelling and Validation of Concurrent Systems. Springer, Heidelberg (2009)
Jensen, K.: An Introduction to the Practical Use of Coloured Petri Nets, vol. 1492, pp. 237–292. Springer, Heidelberg (1998)
Kristensen, L., Christensen, S.: Implementing Coloured Petri Nets Using a Functional Programming Language. Higher-Order and Symbolic Computation 17(3), 207–243 (2004)
Mulyar, N., Aalst, W.: Patterns in Colored Petri Nets. Beta Working Paper Series (2005)
CPN-Tool Homepage, http://cpntools.org/
Blumofe, R., Leiserson, C.: Scheduling Multithreaded Computations by Work Stealing. Journal of the ACM 46(5), 720–748 (1999)
Arora, N., Blumofe, R., Plaxton, C.: Thread Scheduling for Multiprogrammed Multiprocessors. In: The Tenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Puerto Vallarta, Mexico, pp. 119–129 (1998)
Hendler, D., Lev, Y., Moir, M., Shavit, N.: A Dynamic-Sized Non-blocking Work Stealing Deque. Journal of Distributed Computing 18(3), 189–207 (2005)
Hendler, D., Shavit, N.: Non-blocking Steal-Half Work Queues. In: The Twenty-First Annual Symposium on Principles of Distributed Computing, Monterey, California, pp. 280–289 (2002)
Acar, U., Blelloch, A., Blumofe, R.: The Data Locality of Work Stealing. In: The Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures, Bar Harbor, Maine, United States, pp. 1–12 (2000)
Chase, D., Lev, Y.: Dynamic circular work-stealing deque. In: The Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA, pp. 21–28 (2005)
Peterson, J.: Petri Nets. ACMÂ 9(3) (1977)
Murata, T.: Petri Nets: Properties, Analysis and Applications. IEEEÂ 77(4), New Yark (1989)
Gansner, E., Reppy, J.: The Standard ML Basis Library. University of Cambridge, New Yark (2002)
Ullman, J.: Elements of ML Programming. Prentice-Hall, Englewood Cliffs (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Al-Obaidi, A.M., Lee, S.P. (2011). A Concurrent Coloured Petri Nets Model for Solving Binary Search Problem on a Multicore Architecture. In: Zain, J.M., Wan Mohd, W.M.b., El-Qawasmeh, E. (eds) Software Engineering and Computer Systems. ICSECS 2011. Communications in Computer and Information Science, vol 181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22203-0_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-22203-0_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22202-3
Online ISBN: 978-3-642-22203-0
eBook Packages: Computer ScienceComputer Science (R0)