{"title":"Access key distribution scheme for level-based hierarchy","authors":"Mingxing He, P. Fan, F. Kaderali, Ding Yuan","doi":"10.1109/PDCAT.2003.1236456","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236456","url":null,"abstract":"A new access key distribution scheme is proposed for applications where users are in a level-based hierarchy. Based on Chinese remainder theorem (CRT) and Rabin-based secure public key cryptosystem, the proposed scheme has the following characteristics: (1) each user can derive the secret key for user in a lower security level and the inversion is not allowed; (2) the key generation and derivation algorithms are simple; (3) the user and secret key selection are flexible; (4) semantic security can be ensured to prevent attacking from users with lower privileges.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127355517","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":"Noah's ark strategy for avoidance of excess convergence by a parallel genetic algorithm with an object-shared space","authors":"I. limura, S. Ikehata, S. Nakayama","doi":"10.1109/PDCAT.2003.1236358","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236358","url":null,"abstract":"In a genetic algorithm (GA), the undesirable phenomenon of excess convergence can often occur. Excess convergence is the phenomenon where the diversity of a group is lost. This phenomenon occurs because homogeneous individuals are increased rapidly in the group while evolving or searching. Therefore, crossover loses its function. Once the excess convergence occurs, the search by the GA becomes meaningless. Therefore, it is important to avoid excess convergence and maintain diversity. First, we show an implementation of a parallel GA based on a multiple-group-type island model, that uses object-shared space. Next, as a simple, effective method for avoiding excess convergence, we propose a diversity maintenance technique based on selection of the homogeneous individuals called the Noah's ark strategy for parallel GAs, and demonstrate its effectiveness on a knapsack problem. Our proposed method is to replace individuals in sub-groups that have excessively converged with the new individuals coming from the search space. That is, we avoid excess convergence by expelling homogeneous individuals, with the exception of one \"elite\" individual (that we call for Noah). Thus, we limit a decrease in diversity of an entire group.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130854104","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}
F. Cheng, C. Meinel, T. Engel, G. Mullenheim, J. Bern, D. Thewes
{"title":"A complete solution for highly secure data exchange: lock-keeper and its advancements","authors":"F. Cheng, C. Meinel, T. Engel, G. Mullenheim, J. Bern, D. Thewes","doi":"10.1109/PDCAT.2003.1236288","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236288","url":null,"abstract":"The lock-keeper is a new network security solution which can provide secure data transfers between two different networks without having to establish a direct physical connection. By means of the lock-keeper system, the possibility of direct attacks to the protected network can be eliminated. An actual system, the singlegate lock-keeper, is used as an example to introduce the lock-keeper concept in detail, including its architecture, functionalities, applications, vulnerabilities and benefits. Based on this system, a new advanced dualgate lock-keeper including another \"gate\" unit is proposed that can provide more efficient and secure data exchange and make extensions of the lock-keeper applications possible.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126766813","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 convergence bounds of GMRES algorithm","authors":"G. Xie","doi":"10.1109/PDCAT.2003.1236406","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236406","url":null,"abstract":"We first make a brief review of GMRES convergence results. Then we derive new bounds for the GMRES residual norm by making use of a unitary matrix U and a Hermitian positive definite matrix P, which are GMRES-equivalent to the coefficient matrix A with respect to the initial residual r/sub 0/. The existence of such U and P was proved by Leonid (2000). As a GMRES residual norm bound for linear systems with Hermitian positive definite coefficient matrices is known and a GMRES residual norm bound for linear systems with unitary coefficient matrices can be readily derived from Liesen's (2000) work, our new bounds follow from the fact that two GMRES-equivalent matrices make the same residual.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121832094","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":"DCFS: file service in commodity cluster dawning4000","authors":"Jin He, Jin Xiong, S. Wu, Yi Lu, Dan Men","doi":"10.1109/PDCAT.2003.1236263","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236263","url":null,"abstract":"We introduce the design and implementation of DCFS (Dawning Cluster File System), a cluster file system developed for the Dawning4000 LINUX clusters. DCFS provides the single name space and binary compatibility with local file system for users and applications on Dawning4000. In addition, it improves system manageability for administrators by embedded file system management considerations into DCFS implementation and provides an easy use interface. Important features of DCFS are presented, including a global management domain, a communication abstraction layer, pipelined file I/O, enhanced multitask capability in storage servers, and fault-tolerance strategy.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127734961","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":"Extended SNR and its application to the performance analysis of hybrid ARQ with code combining system","authors":"Qingchun Chen, P. Fan","doi":"10.1109/PDCAT.2003.1236340","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236340","url":null,"abstract":"An extended SNR concept is proposed to evaluate the performance of hybrid ARQ with code combining. It is shown that the analysis of hybrid ARQ with code combining could be transformed into the analysis of FEC by using the proposed extended SNR. The extended SNR formula with respect to the code symbols in diversity combining is derived, which includes Pursley's SNR formula as a special case. An approximation is presented to evaluate hybrid ARQ with code combining. It is validated by simulation and numerical analysis that both the extended SNR analysis and the proposed approximation are applicable for the performance analysis of hybrid ARQ with code combining.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127819346","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}
Byung-Hyun Yu, Zhiyi Huang, Stephen Cranefield, M. Purvis
{"title":"Supporting Java multimedia applications over ATM networks","authors":"Byung-Hyun Yu, Zhiyi Huang, Stephen Cranefield, M. Purvis","doi":"10.1109/PDCAT.2003.1236271","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236271","url":null,"abstract":"We describe the design and implementation of Java multimedia applications over asynchronous transfer mode (ATM) networks on Linux operating systems (OS). We propose a Java application programming interface (API) that allows Java multimedia applications to run over ATM networks. We present the results of a performance evaluation of the Java ATM API. We also demonstrate how the Java ATM API and Java media framework (JMF) can be used to develop Java multimedia applications over ATM networks. By combining Java's programming advantages and ATM's network capabilities, multimedia applications can take advantage of both technologies using the Java ATM API.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127999263","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":"RT-GRID: a real-time, fault-tolerant grid model","authors":"Deqing Zou, Hai Jin, Song Wu, Jianhua Sun","doi":"10.1109/PDCAT.2003.1236380","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236380","url":null,"abstract":"Computational grids bring together various distributed resources belonging to different organizations, and provide a high-performance computing environment. However, there is another application category, with the requirement of time constraints and fault tolerance, which needs to be processed in such a high-performance platform. It is necessary to incorporate real-time, fault-tolerant properties into computational grid. We propose a real-time, fault-tolerant grid model, called RT-GRID. We discuss the differences of core components between RT-GRID and computational grid. For such issues arose from real-time and fault tolerance, we study it at grid system level, and propose a monolithic architecture.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"497 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132704360","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":"Analysis of a switching fabric employing direct interconnection networks","authors":"Xudong Zhu, Hong Wang, Le Min Li","doi":"10.1109/PDCAT.2003.1236254","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236254","url":null,"abstract":"A k-ary n-cube direct interconnection structure is originally introduced and developed in the context of massively parallel computer (MPC) architectures. In recent years, with the development of VLSI (very large scale integration) technology and requirements of high performance Internet routers/switches, the k-ary n-cube interconnection network is considered to build Terabit routers. Analysis model for three-dimensional torus is presented as switch cores of Internet routes. Delay/throughput characteristics are measured with four different routing algorithms, buffer length and scale of fabric. Also a new algorithm Ladder is presented. All simulation experiments are done on OPNET. Results show that this architecture can build high performance routers. Compared to other routing algorithms, Ladder has better performance.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134021986","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 optimal scheduling algorithm for fork-join task graphs","authors":"Qinghua Li, Youlin Ruan, ShidaYang, Tingyao Jiang","doi":"10.1109/PDCAT.2003.1236370","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236370","url":null,"abstract":"The task duplication based scheduling is a new approach to the scheduling problems. This is known as an NP-complete problem. Although some algorithms are able to find an optimal schedule under certain conditions, they ignored to economize processors and minimize the total completion time. We present a task duplication based balance scheduling (TDBS) algorithm which can schedule a class of fork-join task graph with a complexity of O(|V|/sup 2/), where |V| is the number of tasks. The proposed algorithm generates an optimal schedule with high speedup and efficiency. Simulation results showed that our algorithm has better scheduling length, less completion time and less number of processors than any of compared algorithms.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"516 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133132893","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}