Is Your Graph Algorithm Eligible for Nondeterministic Execution?

Graph algorithms are used to implement data mining tasks on graph data-sets. Besides conducting the algorithms by the default deterministic manner, some graph processing frameworks, especially those supporting asynchronous execution model, provide interfaces for the algorithms to be executed in nond...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the International Conference on Parallel Processing pp. 430 - 439
Main Authors:	Shao, Zhiyuan, Hou, Lin, Ai, Yan, Zhang, Yu, Jin, Hai
Format:	Conference Proceeding Journal Article
Language:	English
Published:	IEEE 01.09.2015
Subjects:	Algorithms Computational modeling Conduction Conferences Convergence Data models data race Gain graph processing Graphs Instruction sets Iterative methods nondeterministic execution Parallel processing parallel programming Scheduling Tasks
ISSN:	0190-3918
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!