A Deterministic Parallel Computing Approach Optimised for Multicore Architecture

Authors

  • Iqbal S

Keywords:

Parallel Computing, Multicore Architecture, Scheduling Algorithm

Abstract

In software computing, computation is done either deterministic or non-deterministic approach. Deterministic approach includes the constraint like dependency of data in which no random computation is involved. This paper talks about how to achieve more parallelism in context of a deterministic computation approach for the dual-core architecture. In this paper a new Scheduling algorithm which termed as “LA Scheduling” algorithm and its associated component has been presented which is mainly optimised for dual core architecture. Simulation result shows that it helps in reducing the response time of a program and average speedup has been increased

References

Cormen, Thomas H., et al. Introduction to algorithms. Vol. 2. Cambridge: MIT press, 2001.

Karpinski, Marek, and Rutger Verbeek. "On randomized versus deterministic computation." Automata, Languages and Programming. Springer Berlin Heidelberg, 1993. 227-240.

Kahn, Arthur B. "Topological sorting of large networks." Communications of the ACM 5.11 (1962): 558-562.

Lee, Edward A. "The problem with threads." Computer 39.5 (2006): 33-42.

Silberschatz, Abraham, et al. Operating system concepts. Vol. 4. Reading: Addison-Wesley, 1998.

Bosilca, George, et al. "DAGuE: A generic distributed DAG engine for high performance computing." Parallel Computing 38.1 (2012): 37-51.

Intel Corporation https://software.intel.com/en-us/articles/multi-core-processor-architecture-explained October 2008

Downloads

Published

2015-01-31

How to Cite

[1]
S. Iqbal, “A Deterministic Parallel Computing Approach Optimised for Multicore Architecture”, Int. J. Comp. Sci. Eng., vol. 3, no. 1, pp. 58–60, Jan. 2015.

Issue

Section

Research Article