PVM Computation of the Transitive Closure: The Dependency Graph Approach

Pagourtzis, A; Potapov, I; Rytter, W

dc.contributor.author	Pagourtzis, A	en
dc.contributor.author	Potapov, I	en
dc.contributor.author	Rytter, W	en
dc.date.accessioned	2014-03-01T02:49:06Z
dc.date.available	2014-03-01T02:49:06Z
dc.date.issued	2001	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34293
dc.subject	Coarse Grained	en
dc.subject	Dependence Graph	en
dc.subject	Distributed Parallel Computing	en
dc.subject	Transitive Closure	en
dc.title	PVM Computation of the Transitive Closure: The Dependency Graph Approach	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-45417-9_35	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-45417-9_35	en
heal.publicationDate	2001	en
heal.abstract	Abstract: We investigate experimentally a dependency graph approachto the distributed parallel computation of the generic transitive closure problem. A parallel coarse-grained algorithm is derived from anegrainedalgorithm. Its advantage is that approximately half of the workis organised as totally independent computation sequences of several processes.	en
heal.journalName	Parallel Virtual Machine / Message Passing Interface	en
dc.identifier.doi	10.1007/3-540-45417-9_35	en