{"title":"Execution of regular DO loops on asynchronous multiprocessors","authors":"Pei Ouyang","doi":"10.1109/IPPS.1991.153843","DOIUrl":null,"url":null,"abstract":"Studies the execution of a Fortran DO loop, modeled as an iteration space and several dependence vectors, on an asynchronous shared-memory multiprocessor, where each iteration is the basic unit to be executed by a single processing element. During the execution of a DO loop, an iteration will pass through four states, namely, idle, pending, ready, and finished states. By describing an execution scheme, the paper studies (1) the number of iterations not depending on any other iterations, (2) the maximum number of ready iterations at any instance during the execution, (3) the maximum number of pending iterations at any instance during the execution, (4) a hash function to disperse different pending iterations, and (5) the parallel execution time.<<ETX>>","PeriodicalId":159687,"journal":{"name":"[1991] Proceedings. The Fifth International Parallel Processing Symposium","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings. The Fifth International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1991.153843","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Studies the execution of a Fortran DO loop, modeled as an iteration space and several dependence vectors, on an asynchronous shared-memory multiprocessor, where each iteration is the basic unit to be executed by a single processing element. During the execution of a DO loop, an iteration will pass through four states, namely, idle, pending, ready, and finished states. By describing an execution scheme, the paper studies (1) the number of iterations not depending on any other iterations, (2) the maximum number of ready iterations at any instance during the execution, (3) the maximum number of pending iterations at any instance during the execution, (4) a hash function to disperse different pending iterations, and (5) the parallel execution time.<>