Yong-Cheol Kim, Minsoo Jeon, Dongseung Kim, A. Sohn
{"title":"Communication-efficient bitonic sort on a distributed memory parallel computer","authors":"Yong-Cheol Kim, Minsoo Jeon, Dongseung Kim, A. Sohn","doi":"10.1109/ICPADS.2001.934815","DOIUrl":"https://doi.org/10.1109/ICPADS.2001.934815","url":null,"abstract":"Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Bitonic sorting can be parallelized, however, a great portion of execution time is consumed due to O(log/sup 2/P) time of data exchange of N/P keys where P, N are the number of processors and keys, respectively. This paper presents an efficient way of data communication in bitonic sort to minimize the interprocessor communication and comparison time. Before actual data movement, each pair processor exchanges the minimum and maximum in its list of keys to determine which keys are to be sent to its partner. Very often no keys need to exchange, or only a fraction of them are exchanged. At least 20% or greater of execution time could be reduced on the T3E computer in our experiments. We believe the scheme is a good way to shorten the communication time in similar applications.","PeriodicalId":144667,"journal":{"name":"Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128439047","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 implementation of Virtual Interface Architecture using adaptive transfer mechanism on Myrinet","authors":"Jung-Lok Yu, Moon-Sang Lee, S. Maeng","doi":"10.1109/ICPADS.2001.934892","DOIUrl":"https://doi.org/10.1109/ICPADS.2001.934892","url":null,"abstract":"User-level communication is investigated by many researchers, in order to resolve the performance degradation of cluster systems due to inefficient communication protocols. It removes the kernel intervention from the critical communication path. Intel, Microsoft and Compaq introduced the Virtual Interface Architecture (VIA), a standard for user-level communication. However, the existing VIA implementation shows low performance in transferring small messages, because it uses a single mechanism to transfer messages without regard to their message size. We implement a high performance VIA, KVIA (Kaist VIA). KVIA, based on descriptor and message size, dynamically selects a proper transfer mechanism. This implementation effectively handles not only large messages but also small messages. Thus, it can be better applied to the systems that frequently use small messages (e.g., lock protocols for software distributed shared memory). The performance of KVIA is reported using round-trip latency and one-way bandwidth. Our results show the round-trip latency of 40 micro-seconds and the maximum one-way bandwidth of 950 Mbits per second, which is about 74% of Myrinet link's peak bandwidth.","PeriodicalId":144667,"journal":{"name":"Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001","volume":"11 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123410430","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":"Jato: a compact binary file format for Java class","authors":"Sheng-de Wang, Yuh-Juh Lin","doi":"10.1109/ICPADS.2001.934855","DOIUrl":"https://doi.org/10.1109/ICPADS.2001.934855","url":null,"abstract":"Java has been a very important programming language, especially with its cross-platform characteristics, but the CLASS file format defined in the Java Virtual Machine (JVM) specification contains many redundancies and replications of information. These redundancies most come from the \"constant pool\" of a CLASS file. We propose a compact binary file format, called Jato, and its associated archive format, called Jatar, for the Java system. Using these two formats, many of the redundancies can be removed. We didn't utilize any text compression technique in the proposed formats, so they do not sacrifice the loading speed and are thus very suitable for use in embedded environments. We've also implemented a class loader that is capable of loading the Jato files into a regular JVM. Using this approach, we show that the Jato file format is effective and promising, while still keeping the cross-platform features of Java.","PeriodicalId":144667,"journal":{"name":"Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001","volume":"361 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123555953","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}
H. Kwon, Jong Tai Lee, Heung-Hwna Kim, Kwan-Jong Yoo
{"title":"A migration strategy of mobile agent","authors":"H. Kwon, Jong Tai Lee, Heung-Hwna Kim, Kwan-Jong Yoo","doi":"10.1109/ICPADS.2001.934887","DOIUrl":"https://doi.org/10.1109/ICPADS.2001.934887","url":null,"abstract":"We present an efficient migration strategy of a mobile agent for data mining applications. The purpose of the proposed algorithm is to set up the best migration plan of the mobile agent with regard to minimizing network execution time. In order to verify the effectiveness of the proposed algorithm, we designed a performance evaluation model for three distributed paradigms from data mining, i.e. RPC (remote procedure call), mobile agent and locker pattern, and we then evaluated the algorithm by simulation.","PeriodicalId":144667,"journal":{"name":"Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123798556","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 implementation of Structured Gamma","authors":"G. Paillard, F. França, J. M. Filho","doi":"10.1109/ICPADS.2001.934852","DOIUrl":"https://doi.org/10.1109/ICPADS.2001.934852","url":null,"abstract":"Presents a distributed implementation of the Structured Gamma programming language, a language based on the Gamma multi-set rewriting paradigm. Structured Gamma offers, in addition to the advantages introduced by Gamma, implicit concurrent behavior and a type system where not only types themselves are defined but also the automatic verification of user-defined types at compilation time. The problems and mechanisms involved in an MPI-based implementation of Structured Gamma using a type-checking engine based on the most general unifier (MGU) are investigated.","PeriodicalId":144667,"journal":{"name":"Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122217144","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 server framework for scheduling multimedia applications in open system environment","authors":"J. Jang, W. Ahn, D. Park","doi":"10.1109/ICPADS.2001.934867","DOIUrl":"https://doi.org/10.1109/ICPADS.2001.934867","url":null,"abstract":"We propose methods for scheduling multimedia soft real-time tasks in an open system environment. We discuss two issues, guaranteeing the schedulability of every task in the application and meeting the QoS of multimedia soft real-time tasks. First, when a real-time application is composed of a heterogeneous task set, hard real-time tasks and multimedia soft real-time tasks, the operating system must guarantee the schedulability of each task in the application. These guarantees can be achieved by preserving the CPU bandwidth of each task in the application. We have designed a server framework that preserves the CPU bandwidth of each task in the application. Each task can select its own server that can satisfy its time constraints. Second, when an operating system schedules multimedia soft real-time tasks in an open system, it is important for the operating system not only to support sufficient QoS level for the task, but also to utilize the CPU bandwidth of the system efficiently. We invented a new method of utilizing the CPU bandwidth of the system efficiently while supporting the requested QoS level.","PeriodicalId":144667,"journal":{"name":"Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128371818","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}
Keiichi Tamura, Y. Nakano, K. Kaneko, A. Makinouchi
{"title":"The parallel processing of spatial selection for very large geo-spatial databases","authors":"Keiichi Tamura, Y. Nakano, K. Kaneko, A. Makinouchi","doi":"10.1109/ICPADS.2001.934889","DOIUrl":"https://doi.org/10.1109/ICPADS.2001.934889","url":null,"abstract":"Earth science (ES) applications handle very large geo-spatial data sets and interactive response time is required by its query processing. Spatial selection is one of the very important basic operations for geo-spatial databases. It retrieves all the objects that intersect with a given point or rectangle. We present a novel approach for the parallel processing of spatial selection of very large geo-spatial databases using partitioned parallelism. To evaluate this approach, we use the Extended Sequoia 2000 benchmark, which has real world data and real queries. In addition, we use an actual object database management system, ShusseUo, which we developed previously. The experimental results of parallel processing of spatial selection show good speed-up.","PeriodicalId":144667,"journal":{"name":"Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128981421","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":"SIMMT-II: implementation of network simulator for IP multicast using multiple MCSs on the ATM networks","authors":"Tae-Young Byun","doi":"10.1109/ICPADS.2001.934823","DOIUrl":"https://doi.org/10.1109/ICPADS.2001.934823","url":null,"abstract":"We implemented a network simulator for performance evaluation of various IP multicast schemes over ATM networks. We also described design details of the network simulator, in which necessary software modules can be added easily. This network simulator can generate various random networks, assigns multiple multicasting servers and many group members with various distribution patterns over random networks. In addition, we can apply various routing-related algorithms to the network simulator to acquire results of performance evaluation. We show the correct behavior of the implemented simulator by evaluating the performance of several recovery schemes for an impaired multicast tree in the case where some multicast servers fail.","PeriodicalId":144667,"journal":{"name":"Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130331532","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}
Jongwook Woo, Jehak Woo, I. Attali, D. Caromel, J. Gaudiot, A. Wendelborn
{"title":"Alias analysis for Java with reference-set representation","authors":"Jongwook Woo, Jehak Woo, I. Attali, D. Caromel, J. Gaudiot, A. Wendelborn","doi":"10.1109/ICPADS.2001.934854","DOIUrl":"https://doi.org/10.1109/ICPADS.2001.934854","url":null,"abstract":"Proposes a flow-sensitive, context-insensitive alias analysis in Java that is more efficient and precise than previous analyses in C++. For this, we propose a reference-set alias representation and we present the propagation rules for this representation. For the type determination, the type table is built with reference variables and with all possible types of those variables. We propose an algorithm in a popular iterative loop method with a structural traversal of a context-free grammar. Finally, we show that our reference-set representation has better performance for the alias analysis algorithm than the existing object-pair representation does.","PeriodicalId":144667,"journal":{"name":"Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121984580","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":"Improving workload balance and code optimization in processor-in-memory systems","authors":"S. Chu, Tsung-Chuan Huang, Lan-Chi Lee","doi":"10.1109/ICPADS.2001.934830","DOIUrl":"https://doi.org/10.1109/ICPADS.2001.934830","url":null,"abstract":"PIM (Processor-In-Memory) architectures have been proposed in recent years. One major objective of PIM is to reduce the performance gap between the CPU and memory. To exploit the potential benefits of PIM, we designed a statement base parallelizing system-SAGE. In this paper, we extend this system to achieve better performance by devising several comprehensive optimizing techniques, which include IMOP (Intelligent Memory Operation) recognition, tiling for PIM, and a precise mechanism to get load-balanced execution schedule. The experimental results are also presented and discussed.","PeriodicalId":144667,"journal":{"name":"Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133631241","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}