New approach to register communication in multi-core systems
Journal: International Journal of Management sciences and Education (Vol.1, No. 2)Publication Date: 2014-03-05
Authors : Fariborz Ahmadi; Hamid Salehi; Saied Veria Hosaini;
Page : 21-27
Keywords : multi-core systems; multi-thread system; algorithm;
Abstract
The recent shift in the industry towards chip multiprocessor (CMP) makes it necessary that multi-threaded applications be mainstream computing. Most of the parallelization opportunities require looking for parallelism in local regions of code. To extract these parallelisms, especially for sequential applications, global multi-threaded instruction scheduling has been proposed. These techniques simultaneously extracted instructions from sequential codes and distributed them to cores. A key advantage of these global instruction scheduling techniques is the Multi-Threaded Code Generation (MTCG) algorithm which produce threads codes for each partition of graph and inserts communication and synchronization instructions to satisfy all inter-thread dependences. In this paper, we present an algorithm to reduce the communication and synchronization instructions. This algorithm based on thread aware dataflow analyses and adjacent list, models and optimizes register dependences among threads. The running time of the best algorithms, like Min-cut algorithm, is O (n3 ). But proposed algorithm act like Min-cut algorithm to reduce and insert communication instructions with running time of O (n2 ).
Other Latest Articles
- Examining The Effect Of Ad Poster Including Islamic Cues On Potential Cosumers’ Purchase Intention
- Examining The Effect Of Ad Poster Including Islamic Cues On Potential Cosumers’ Purchase Intention
- Design of Reversible Circuits for Code Converter and Binary Incrementer
- Leadership Behavior of BATELEC I Department and Area Office Managers: Basis for Enhancement
- Parenting Styles and Competitiveness among Mothers of Preschool Children
Last modified: 2014-07-22 20:25:12