Performance of parallel computations of triangular structure

Stafylopatis, Andreas

dc.contributor.author	Stafylopatis, Andreas	en
dc.date.accessioned	2014-03-01T01:09:30Z
dc.date.available	2014-03-01T01:09:30Z
dc.date.issued	1993	en
dc.identifier.issn	0267-6192	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11034
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0027297531&partnerID=40&md5=bd93a4535440538a21077ea3143aeb5c	en
dc.subject	PARALLEL COMPUTATION	en
dc.subject	PERFORMANCE EVALUATION	en
dc.subject	PROBABILISTIC MODELING	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Computer architecture	en
dc.subject.other	Performance	en
dc.subject.other	Parallel computations	en
dc.subject.other	Triangular structures	en
dc.subject.other	Parallel processing systems	en
dc.title	Performance of parallel computations of triangular structure	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1993	en
heal.abstract	By virtue of their inherent parallelism, matrix algorithms such as those for solving large systems of linear equations are of major importance in parallel computation. We are interested here in evaluating the speed-up obtained during the parallel execution of algorithms, whose task graph features as triangular structure. The mean execution time under probabilistic assumptions is computed for two different parallel execution schemes depending on the scheduling policy adopted. Our modeling approach involves the development of an approximation technique for studying loosely coupled Markovian processes.	en
heal.publisher	C R L PUBLISHING LTD	en
heal.journalName	Computer Systems Science and Engineering	en
dc.identifier.isi	ISI:A1993KK16900003	en
dc.identifier.volume	8	en
dc.identifier.issue	1	en
dc.identifier.spage	24	en
dc.identifier.epage	32	en