{"title":"Extracting the parallelism in program with unstructured control statements","authors":"Fubo Zhang, E. D'Hollander","doi":"10.1109/ICPADS.1994.590307","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590307","url":null,"abstract":"Program parallelization is inhibited by unstructured control statements such as GOTOs, causing interacting and overlapping execution trajectories. In this contribution, a program restructuring method is proposed to convert unstructured control statements into block if statements and while loops. Furthermore, an algorithm is presented to transform a common type of while loops into do loops. The technique works for while loops of which the control variables satisfy a linear recurrence relation. As a result, the loop carried dependencies generated by the control variables are removed. If there are no other loop carried dependencies, the do loop may then be converted into a doall loop. The algorithm has been used to test and convert a significant number of while loops into doall loops for a suite of well-known numerical benchmarks.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117102368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Storage design and retrieval of continuous multimedia using multi-disks","authors":"Wen-Jiin Tsai, Suh-Yin Lee","doi":"10.1109/ICPADS.1994.590069","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590069","url":null,"abstract":"In the domain of multimedia applications, continuous display is an important issue. In this paper, we present a practical method to allocate disk storage for multimedia data so that continuous requirement can be met. This technique explores data-transfer parallelism on a multidisk system. Moreover, in order to ensure that continuous retrieval can be achieved in a multiuser environment, we propose the dynamic scheduling mechanism for real-time object retrieval. It can be seen that, a good scheduling can explore higher access concurrency in display of multimedia applications. Several approaches with different trade-off based upon this mechanism are proposed in this paper, which include delay initiation, read-ahead, migration, segmentation and integration.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124882992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A kernel-level DSVM controller for the diskless cluster system","authors":"Feng-Ming Hsieh, Ying-Nan Chen, L. Tseng","doi":"10.1109/ICPADS.1994.590414","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590414","url":null,"abstract":"Investigates the distributed shared virtual memory (DSVM) technique in a distributed diskless PC cluster system environment. By integrating distributed shared memory (DSM) and virtual memory functions, the DSVM model not only supports the sharing of process space but also provides the sharing of system-supported space (e.g. swapping area). DSVM controllers are handlers in a diskless PC cluster system whose responsibility is to control the operations of DSM and to handle the sharing when the local physical memory needs to do page/process swap-in and out. This paper presents the model, describes the requirements and how the model supports the diskless PC in a diskless PC cluster system, discusses several design issues, and narrates prototype implementation details and considerations. The developed primitives of this prototype are the base of a complete DSVM mechanism and process migration. Integrating the two mechanisms will promote the system to be a powerful group computing platform.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130065021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Branch prediction for enhancing fine-grained parallelism in Prolog","authors":"Ruey-Liang Ma, C. Chung","doi":"10.1109/ICPADS.1994.590462","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590462","url":null,"abstract":"Branch instructions create barriers to instruction fetching, thus greatly reducing the fine-grained parallelism of programs. One common method for solving this problem is branch prediction. We first present four lemmas to clarify the relationship between the branch prediction hit rate and system performance, hardware efficiency, and branch prediction overhead. We then propose a new branch prediction method called PAM (Period Adaptive Method). An abstract model and detailed implementation of PAM are described. The prediction hit rate of this method was measured using ten Prolog benchmark programs and found to be 97%. When implemented in a superscalar Prolog system, PAM enhances the degree of system parallelism by 80%.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130194611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A discrete-event simulation model for characterizing parallel file transfers","authors":"C. Chee, E. Im, C. Ramamoorthy","doi":"10.1109/ICPADS.1994.590071","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590071","url":null,"abstract":"In this paper, we characterize the performance of parallel file transfers using the Zebra striped network file system by means of distributed discrete-event simulation model which uses a variation of the conservative timestamping-technique. The simulator is a powerful tool that can be adapted to model related systems such as multiprocessors and distributed shared memories. Preliminary simulation results confirm the results in published literature. Experiences with building the distributed simulator are also discussed.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131007444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A distributed memory multiprocessor implementation of C-with-Ease","authors":"T. MacKenzie, T. Dix","doi":"10.1109/ICPADS.1994.590304","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590304","url":null,"abstract":"C-with-Ease is a superset of C, with primitives borrowed from Ease for process creation and communication. All communication is via distributed data structures called contexts. We present an efficient implementation of C-with-Ease for the Fujitsu AP1000, a distributed memory, message passing multiprocessor. We use two of the three AP1000 communication networks: the torus net for point to point communication and the broadcast net to maintain a global view of processor allocation.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130436877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A mesh partitioning tool and its applications to parallel processing","authors":"S. Hsieh","doi":"10.1109/ICPADS.1994.590080","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590080","url":null,"abstract":"This paper describes the features and implementation of a mesh partitioning tool called PSAINT and its applications to parallel processing research and education. PSAINT is an interactive graphics program with a friendly interface for user-program interaction. It offers several automatic mesh partitioning algorithms as well as a set of graphics tools for manual partitioning and for evaluation and modification of the results of automatic partitioning. The program automatically generates various statistics results and allows for visualization of the mesh partitions. PSAINT was originally developed as a key component in an integrated parallel finite element analysis system. Recently, it has been extended to facilitate evaluation and comparative studies of automatic mesh partitioning algorithms. It has also been used to aid the teaching in a graduate-level structural engineering course for parallel processing.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129287874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the embedding of a class of regular graphs in a faulty hypercube","authors":"Y. Tseng, T. Lai","doi":"10.1109/ICPADS.1994.590360","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590360","url":null,"abstract":"A wide range of graphs with regular structures are shown to be embeddable in an injured hypercube with faulty links. These include rings, linear paths, binomial trees, binary trees, meshes, tori, and many others. Unlike many existing algorithms which are capable of embedding only one type of graphs, our algorithm embeds the above graphs in a unified way, all centered around a notion called edge matrix. In many cases, the degree of fault tolerance offered by the algorithm is optimal or near-optimal.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126342214","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An assertional proof of a lock synchronization algorithm using fetch and store atomic instructions","authors":"Ting-Lu Huang, Jann-Hann Lin","doi":"10.1109/ICPADS.1994.590470","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590470","url":null,"abstract":"A new lock synchronization algorithm, proposed independently by Craig and the authors, not only eliminates memory contention caused by process spinning but also preserves first in first out property. A previous result, the MCS lock algorithm, requires both compare and swap and fetch and store instructions, or the FIFO property is lost and hence starvation may occur. The new one requires only fetch and store. We provide an assertional proof for the new algorithm. Most of behavioral proofs of concurrent programs are error-prone since it is difficult and tedious to take all possibilities of interleaving among the processes into consideration. An assertional proof replaces a large number of possibilities of interleaving by a small number of invariants. New techniques in this proof are: an assertional characterization of token bit accessibility; the definition of effective assignments that brings about the notion of token creation/destruction; the definition of token count that derives the mutual exclusion theorem; and the constructing procedure of a token-list that faithfully records the arrival time sequence of lock requests so that FIFO ordering can be enforced.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126587467","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Exploiting communication latency hiding for parallel network computing: model and analysis","authors":"V. Strumpen, T. Casavant","doi":"10.1109/ICPADS.1994.590409","DOIUrl":"https://doi.org/10.1109/ICPADS.1994.590409","url":null,"abstract":"Very large problems with high resource requirements of both computation and communication could be tackled with large numbers of workstations. However for LAN-based networks, contention becomes a limiting factor whereas latency appears to limit communication for WAN-based networks, nominally the Internet. We describe a model to analyze the gain of communication latency hiding by overlapping computation and communication. This model illustrates the limitations and opportunities of communication latency hiding for improving speedup of parallel computations that can be structured appropriately. Experiments show that latency hiding techniques increase the feasibility of parallel computing in high-latency networks of workstations across the Internet as well as in multiprocessor systems.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116241543","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}