A Parallel Programming Pattern Based on Directed Acyclic Graph

Zheng Meng; Ying Lin; Yan Kang; Qian Yu

doi:10.4028/www.scientific.net/AMM.303-306.2165

Paper Titles

Research and Application of Mass Storage System (MSS) in University Hybrid Libraries
p.2149

Research on Application of Internet of Things in Nursing Home
p.2153

Strategy Study on Maximum Degree and Bisection Degree Synchronization Search in Scale-Free Networks
p.2157

Study on Informatization Management of Personnel in Colleges
p.2161

A Parallel Programming Pattern Based on Directed Acyclic Graph
p.2165

The Research of Internet of Things in Military Logistic Management
p.2170

An Empirical Analysis of Developer Collaboration Network
p.2177

An Improvement Password-Based Authentication Protocol Using Smart Card
p.2182

Application of Virtual Reality Technology in the Distribution Network Living Work Methods Research
p.2186

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 303-306A Parallel Programming Pattern Based on Directed...

A Parallel Programming Pattern Based on Directed Acyclic Graph

Abstract:

With the development of computer technology, multi-core programming is now becoming hot issues. Based on directed acyclic graph, this paper gives definition of a number of executable operations and establishes a parallel programming pattern. Using verticies to represent tasks and edges to represent communication between vertex, this parallel programming pattern let the programmers easily to identify the available concurrency and expose it for use in the algorithm design. The proposed pattern can be used for large-scale static data batch processing in multi-core environments and can bring lots of convenience when deal with complex issues.

You might also be interested in these eBooks

Sensors, Measurement and Intelligent Materials

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 303-306)

Pages:

2165-2169

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.303-306.2165

Citation:

Cite this paper

Online since:

February 2013

Authors:

Zheng Meng, Ying Lin, Yan Kang, Qian Yu

Keywords:

Directed Acyclic Graph, Multi-Core Programming, Parallel Programming Pattern

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] IVERSON M OZGUNER F. Dynamic competitive scheduling of multiple DAGs in a distributed heterogeneous environment [A]. 7th IEEE Symposium on Heterogeneous Computing Workshop (HCW'98) [C]. Orlando: IEEE Computer Society 1998. 70-78.

DOI: 10.1109/hcw.1998.666546

Google Scholar

[2] SANYAL S, AIN A, DAS S K, et al. A hierarchical and distributed approach for mapping large applications to heterogeneous grids using genetic algorithms[A]. Proceedings of the IEEE International Conference on Cluster Computing (CLUSTER' O3D [C] Hong Kong, IEEE Computer Society, 2003. 496-499.

DOI: 10.1109/clustr.2003.1253357

Google Scholar

[3] MAHESWARAN M SIEGEL H. A dynamic matching and scheduling algorithm for heterogeneous computing systems [A]. 7th IEEE Symposium on Heterogeneous Computing Workshop (HCW'98) [C]. Orlando, IEEE Computer Society 1998. 57-69.

DOI: 10.1109/hcw.1998.666545

Google Scholar

[4] Weimin Yan，Weimin Wu. Data Structure（C language）[M]. Beijing：Qinghua University press，2002 (In Chinese).

Google Scholar

[5] Jin Chen, Jinke Chen. DAG Scheduling algorithms in isomorphic environment[J]. Computer engineering and design，2009，(3): 668-670 (In Chinese).

Google Scholar