{"title":"Performance evaluation of nested-loop join processing on networks of workstations","authors":"Kenji Imasaki, S. Dandamudi","doi":"10.1109/ICPADS.2000.857740","DOIUrl":"https://doi.org/10.1109/ICPADS.2000.857740","url":null,"abstract":"Networks of workstations (NOWs) are attractive for parallel processing due to their cost advantage. This paper investigates the performance issues in processing join operations and the inherent tradeoff in the networked workstation environment. Specifically, we look at the performance of the nested-loop join algorithm. Since NOWs are heterogeneous in nature, load sharing is important for their performance. We evaluated the performance of three load sharing methods: static equal, static proportional and dynamic scheduling with fixed-chunk size. The three scheduling methods are evaluated on an experimental heterogeneous network of workstations with non-query background loads. Our experimental result suggest that, when there is no background load, dynamic scheduling outperforms static equal scheduling (up to 40%) and marginally better (about 10% better speedup) than the static proportional scheduling. When there is dynamic background load on nodes, dynamic scheduling provides substantial performance improvement over the static proportional scheduling (up to 50%) and static equal scheduling (up to about 100%). In all cases, selection of an appropriate chunk size is important in dynamic scheduling.","PeriodicalId":196466,"journal":{"name":"Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117232587","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":"Implementation techniques and an object group service for CORBA-based applications in the field of parallel processing","authors":"M. Aleksy, Axel Korthaus","doi":"10.1109/ICPADS.2000.857684","DOIUrl":"https://doi.org/10.1109/ICPADS.2000.857684","url":null,"abstract":"We examine the suitability of CORBA based solutions for meeting application requirements in the field of distributed parallel programming. We outline concepts defined within CORBA which are helpful for the development of parallel applications, and we describe which programming techniques are at hand for this purpose. Subsequently, we present an object group service which facilitates the development of CORBA based distributed and parallel software applications. Moreover, we introduce some basic ideas of how the Unified Modeling Language (UML) can be used for modeling parallel applications.","PeriodicalId":196466,"journal":{"name":"Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122869532","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 efficient algorithm for processing distributed queries using partition dependency","authors":"Hao Chen, Chengwen Liu","doi":"10.1109/ICPADS.2000.857716","DOIUrl":"https://doi.org/10.1109/ICPADS.2000.857716","url":null,"abstract":"Presents an efficient algorithm for processing distributed queries with the existence of partition dependencies. For a given query, the algorithm first partitions the referenced relations into a number of non-exclusive subsets such that the join operation(s) associated with the relations in the subset can be locally processed without data transfer. Each subset is associated with a set of processing sites and can be used to generate an execution plan for the given query. Then, the algorithm determines a set of referenced fragmented relations that are not in the subset, such that only the fragments (instead of the whole relation) need to be replicated at the processing sites. The other referenced relations are duplicated at each of the processing sites. Among the alternatives, the algorithm picks the plan that gives the minimum response time for the query. Experimental results show that our algorithm improves the performance of distributed query processing significantly.","PeriodicalId":196466,"journal":{"name":"Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132507897","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":"Projecting the performance of decision support workloads on systems with smart storage (SmartSTOR)","authors":"W. Hsu, A. Smith, H. Young","doi":"10.1109/ICPADS.2000.857725","DOIUrl":"https://doi.org/10.1109/ICPADS.2000.857725","url":null,"abstract":"Recent developments in both hardware and software have made it worthwhile to consider embedding intelligence in storage to handle general-purpose processing that can be off-loaded from the hosts. In particular, low-cost processing power is now widely available and software can be made robust, secure and mobile. In this paper, we propose a general smart storage (SmartSTOR) architecture in which a processing unit that is coupled to one or more disks can be used to perform such off-loaded processing. A major part of the paper is devoted to understanding the performance potential of the SmartSTOR architecture for decision support workloads. Our analysis suggests that there is a definite performance advantage in using fewer but more powerful processors, a result that bolsters the case for sharing a powerful processor among multiple disks. As for software architecture, we find that the off-loading of database operations that involve only a single relation is not very promising. In order to achieve significant speed-up, we have to consider the off-loading of multiple-relation operations. In general, if embedding intelligence in storage is an inevitable architectural trend, we have to focus on developing parallel software systems that can effectively take advantage of the large number of processing units that will be in the system.","PeriodicalId":196466,"journal":{"name":"Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126783737","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}