Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)最新文献

{"title":"Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications","authors":"Yamin Li, S. Peng, Wanming Chu","doi":"10.1109/PDCAT.2007.10","DOIUrl":"https://doi.org/10.1109/PDCAT.2007.10","url":null,"abstract":"Given an edge-weighted tree T, a trunk is a path P in T which minimizes the sum of the distances of all vertices in T from P plus the weight of path P. In this paper, we give efficient algorithms for finding a trunk of T. The first algorithm is a sequential algorithm which runs in O(n) time, where n is the number of vertices in T. The second algorithm is a parallel algorithm which runs in O(log n) time using O(n/log n) processors on EREW PRAM model. We also present an application of trunk for efficient multicast in wireless ad hoc networks.","PeriodicalId":323167,"journal":{"name":"Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123041685","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":"Parallel Database Join Operations in Heterogeneous Grids","authors":"W. Mach, E. Schikuta","doi":"10.1109/PDCAT.2007.79","DOIUrl":"https://doi.org/10.1109/PDCAT.2007.79","url":null,"abstract":"This paper presents an analytical comparison of parallel join algorithms in a generalized multiprocessor framework and a simplified, heterogenous Grid environment. We develop a concise but comprehensive analytical model for the well-known hash join algorithm and compare it to nested-loop and sort-merge join algorithms. We concentrate on a limited number of characteristic parameters to keep the analytical model clear and focused. We justify that a meaningful model can be built upon only three characteristic parameter sets, describing node processing performance, the I/O and the disk bandwidth, which are the parameters for the optimization the Grid workflow by a smart brokerage mechanism. Based on these results the paper proves that by a smart enhancement of the algorithms exploiting the specifics of the Grid the known performance results for a homogenous multi-processor architecture are to be revised for a heterogenous Grid environment.","PeriodicalId":323167,"journal":{"name":"Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124000361","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":"MHGrid: Towards an Ideal Optimization Environment for Global Optimization Problems Using Grid Computing","authors":"M. Wahib, Asim Munawar, M. Munetomo, K. Akama","doi":"10.1109/PDCAT.2007.62","DOIUrl":"https://doi.org/10.1109/PDCAT.2007.62","url":null,"abstract":"This paper introduces MHGrid, a framework that exploits meta-heuristics based search methods and grid computing to enable the transparent sharing of heterogeneous and dynamic resources offering a grid based global optimization framework. MHGrid allows a user to solve almost all kinds of global optimization problems in a black box manner with a minimal input from the user, it also allows the user to integrate his own solver into MHGrid. In this paper we will discuss the architecture and motivation of such a system. We will also discuss the challenges/complexities involved in constructing MHGrid.","PeriodicalId":323167,"journal":{"name":"Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123623130","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 Multi-sender Identity Based Threshold Signcryption with Public Verifiability","authors":"Wen Chen, Feiyu Lei","doi":"10.1109/PDCAT.2007.57","DOIUrl":"https://doi.org/10.1109/PDCAT.2007.57","url":null,"abstract":"In this paper, we propose a new multi-sender(t,n) identity based signcryption scheme with public verifiability using pairings , and give a security proof about the original scheme in the random oracle model.","PeriodicalId":323167,"journal":{"name":"Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131905565","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 Scheduling Algorithm for End-to-End Flow Fairness in Wireless Multi-hop Networks","authors":"Xiaowei Qin, Peixia Xu","doi":"10.1109/PDCAT.2007.30","DOIUrl":"https://doi.org/10.1109/PDCAT.2007.30","url":null,"abstract":"A distributed scheduling algorithm is proposed for achieving end-to-end flow max-min fairness in wireless multi-hop networks. The problem is modeled as an optimization problem by taking into account the MAC-layer constraints. With dual programming and Lagrange relaxation, the problem is decomposed into two subproblems, one is for transport layer at the source node, and the other for MAC layer in the network. A max-price based max-min fair rate allocation algorithm is adopted for the transport layer subproblem and an algorithm based on integer programming is designed for scheduling link activities at MAC layer. Simulation results show that the proposed algorithm can achieve conflict-free schedule for wireless links and provide max-min fairness for end-to-end flows efficiently.","PeriodicalId":323167,"journal":{"name":"Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133488816","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":"Extending the Strand Space Method to Verify Kerberos V","authors":"Yongjian Li, Jun Pang","doi":"10.1109/PDCAT.2007.22","DOIUrl":"https://doi.org/10.1109/PDCAT.2007.22","url":null,"abstract":"In this paper, we present two extensions of the strand space method to model Kerberos V. First, we include time and timestamps to model security protocols with times- tamps: we relate a key to a crack time and combine it with timestamps in order to define a notion of recency. Therefore, we can check replay attacks in this new framework. Second, we extend the classic strand space theory to model protocol mixture. The main idea is to introduce a new relation rarr to model the causal relation between one primary protocol session and one of its following secondary protocol session. Accordingly, we also revisit the definition of unsolicited authentication test. To demonstrate the power of this new theory, we model the Kerberos V protocol, and prove its secrecy and authentication goals. Our framework and the proofs of the example have been mechanized using Isabelle/HOL.","PeriodicalId":323167,"journal":{"name":"Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133546614","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":"Local Reputation for P2P MMOG Design","authors":"Shanshan Liu, Jinlong Li, Xufa Wang","doi":"10.1109/PDCAT.2007.24","DOIUrl":"https://doi.org/10.1109/PDCAT.2007.24","url":null,"abstract":"The assignment of the computation and communication is one of the important problems in the design of peer-to-peer (P2P) massively multi-player online game (MMOG). A reputation mechanism for P2P MMOG is proposed in this paper to avoid the problems in P2P design. The communications among peers are described by whether the messages are received timely and correctly in the process of synchronization, and then the reliabilities of peers are quantified. The concept of local reputation is proposed, based on which the adaptive adjusting algorithm for the function of peers and the algorithm for getting update peer selecting reliable computing peers are brought forward to assign the computation and communication of the system. According to the experiments, the algorithms are effective for the distribution of the computation and communication.","PeriodicalId":323167,"journal":{"name":"Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133437729","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 checking the compatibility of web services' policies","authors":"Z. Maamar, Quan Z. Sheng, H. Yahyaoui, D. Benslimane, Fenglin Liu","doi":"10.1109/PDCAT.2007.39","DOIUrl":"https://doi.org/10.1109/PDCAT.2007.39","url":null,"abstract":"This paper discusses the compatibility issue between policies of Web services, which could refrain the automatic composition of these Web services from smoothly progressing. Policies regulate/constrain the functioning of Web services at three levels identified by business, behavior, and privacy. Because independent Web services collaborate with one another in order to satisfy users' needs, their respective policies could be in contradiction. This could lead to conflicts and exceptions at run-time unless these contradictions are as a first step, detected and then, fixed. In this paper, WSPL is the language to specify policies of Web services.","PeriodicalId":323167,"journal":{"name":"Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133820599","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":"e-Science in the Cloud with CARMEN","authors":"Paul Watson","doi":"10.1109/PDCAT.2007.87","DOIUrl":"https://doi.org/10.1109/PDCAT.2007.87","url":null,"abstract":"Summary form only given. Understanding how the brain works is a major scientific challenge which will benefit medicine, biology and computer science. It requires knowledge of how information is encoded, accessed, analysed, archived and decoded by networks of neurons. Globally, over 100,000 neuroscientists are working on this problem. However, the data that forms the basis for their work is rarely shared even though it is difficult and expensive to produce. One of the main reasons for this is that vast amounts of data are produced in a variety of formats; this is then locally described and curated. One consequence is a shortage of analysis techniques that can be applied across neuronal systems. Further, there is only a limited amount of interaction between research centres with complementary expertise. The CARMEN project (www.carmen.org.uk) is addressing these challenges. It enables data sharing, integration, and analysis supported by metadata. An expandable range of services are provided to extract value from raw and transformed data. The project's approach is to design and build a generic e-science platform in the cloud. This provides functionality to neuroscientists, who access it over the web. Scientists upload the data they generate into the system (called a CAIRN) and describe it with metadata. Internally, the CAIRN is built as a set of Web Services. These include a workflow enactment service which allows scientists to analyze data by running workflows that utilise the analysis services also held in the CAIRN. Users can browse the catalogue of existing workflows to select one that is appropriate for the task they are trying to accomplish. More expert users can build their own workflows from the available services. Even more sophisticated users can create their own services to use in workflows. A novel feature of the architecture is that the services are stored in a repository in the CAIRN and scheduled on a grid as required by the execution of workflows. This promotes the sharing of analysis services as well as data, and allows services to execute close to the data on which they operate. This is essential to avoid having to ship vast quantities (TBs) of data out of the CAIRN to the user's machine for analysis. Storing both the data and the services in the CAIRN also enables the reproducibility of analyses. This talk describes the design of the CAIRN and shows how it is used to support neuro informatics.","PeriodicalId":323167,"journal":{"name":"Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129437795","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":"SCMD-CLUSTER: Design, Implementation, and Primary Evaluation","authors":"K. Hayakawa","doi":"10.1109/PDCAT.2007.54","DOIUrl":"https://doi.org/10.1109/PDCAT.2007.54","url":null,"abstract":"This paper introduces SCMD-Cluster system whose nodes are connected each other via special network called SCMD network. Specially, we describe SCIC network as Inner-chassis network on SCMD network. We propose a fast barrier synchronization mechanism and a communication mechanism implemented in SCIC network card. We propose an entire barrier synchronization algorithm using the fast barrier synchronization mechanism on SCMD network. We evaluated latency of barrier synchronization on SCMD cluster.","PeriodicalId":323167,"journal":{"name":"Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127547829","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}