Observations on parallel computation of transitive and Max-Closure problems

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-01T01:18:08Z
dc.date.available	2014-03-01T01:18:08Z
dc.date.issued	2002	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/14808
dc.subject	Coarse Grained	en
dc.subject	Matrix Multiplication	en
dc.subject	Parallel Computer	en
dc.subject	Parallel Implementation	en
dc.subject	Transitive Closure	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	Observations on parallel computation of transitive and Max-Closure problems	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/3-540-45825-5_37	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-45825-5_37	en
heal.language	English	en
heal.publicationDate	2002	en
heal.abstract	We present new approaches to the parallel computation of a class of problems related to the GENERIC TRANSITIVE CLOSURE problem (TC, in short). We identify the main ingredient of the TC problem called the MAX-CLOSURE Problem and concentrate on parallel computation of this subproblem, also we show how to reduce TC to matrix multiplication once the max-closure is computed. We present a new variation of the Warshall algorithm for MAX-CLOSURE, both in fine-grained and coarse-grained forms; the coarse-grained version, appropriate for parallel implementation in PVM is especially designed so as to consist of highly parellelisable submatrix multiplications. We used existing, especially efficient PVM subroutines to realise our new MAX-CLOSURE and TC algorithms; the experimental results show that the new algorithms achieve considerable improvement compared to previously known ones.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	RECENT ADVANCES IN PARALLEL VIRTUAL MACHINE AND MESSAGE PASSING INTERFACE, PROCEEDINGS	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/3-540-45825-5_37	en
dc.identifier.isi	ISI:000188863600025	en
dc.identifier.volume	2474	en
dc.identifier.spage	217	en
dc.identifier.epage	225	en