Full metadata record
DC FieldValueLanguage
dc.contributor.authorPean, DLen_US
dc.contributor.authorChen, Cen_US
dc.date.accessioned2014-12-08T15:43:56Z-
dc.date.available2014-12-08T15:43:56Z-
dc.date.issued2001-05-01en_US
dc.identifier.issn1016-2364en_US
dc.identifier.urihttp://hdl.handle.net/11536/29699-
dc.description.abstractThere are many methods for nested loop partitioning exist: however. most of them perform poorly when they partition loops with non-uniform dependences. This paper proposes a generalized and optimized loop partitioning mechanism which can exploit parallelism in nested loops with non-uniform dependences. Our approach based on the region partitioning technique divides the loop into variable size partitions. Furthermore, the proposed algorithm partitions a nested loop using the copy-renaming and optimized partitioning techniques so as to minimize the serial part of the iteration space. Thus, it out performs previous partition mechanisms for nested loops with non-uniform dependences. Compared with other popular techniques, our scheme shows dramatic improve ment in preliminary performance results.en_US
dc.language.isoen_USen_US
dc.subjectcompilersen_US
dc.subjectnon-uniform dependenceen_US
dc.subjectloop parallelizationen_US
dc.subjectparallel compileren_US
dc.subjectparallel processingen_US
dc.subjectregion partitioning techniqueen_US
dc.titleAn optimized three region partitioning technique to maximize parallelism of nested loops with non-uniform dependencesen_US
dc.typeArticleen_US
dc.identifier.journalJOURNAL OF INFORMATION SCIENCE AND ENGINEERINGen_US
dc.citation.volume17en_US
dc.citation.issue3en_US
dc.citation.spage463en_US
dc.citation.epage489en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000169806600007-
dc.citation.woscount1-
Appears in Collections:Articles


Files in This Item:

  1. 000169806600007.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.