{"title":"Performance Evaluation of Security Services: An Experimental Approach","authors":"A. Cilardo, L. Coppolino, A. Mazzeo, L. Romano","doi":"10.1109/PDP.2007.64","DOIUrl":"https://doi.org/10.1109/PDP.2007.64","url":null,"abstract":"Recent advances in wireless technologies have enabled pervasive connectivity to Internet scale systems which include heterogeneous mobile devices, such as mobile phones and personal digital assistants, a trend which is generally referred to as ubiquitous computing. This leads to the need for providing security functions to applications which are partially deployed over wireless devices. Delivering security services to mobile devices raises a number of challenging issues, mostly related to the limited amount of computing power which is typically available on the target plat-forms. Some promising solutions rely on multi-tier architectures, which are based on the emerging Web services technology. In this scenario, understanding the impact of architectural characteristics of specific platforms is a key issue for practitioners who have to develop and deploy efficient security-enabled applications on mobile devices. This paper provides an experimental study of the impact that specific characteristics of individual mobile device platforms have on the final performance of security applications. Focus is on performance and resource utilization, which are key aspects when one develops applications on mobile devices. The case study is a Web services based solution for delivering public key infrastructure (PKI) services to mobile devices. Experiments have been conducted on three different mobile terminals, which span a large range of characteristics in the class of resource-constrained devices. Results show that: i) performance figures are not uniform in spite of similar underlying hardware characteristics, and ii) security and performance are often conflicting requirements","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133332573","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":"RealPeer--A Framework for Simulation-Based Development of Peer-to-Peer Systems","authors":"Dieter Hildebrandt, L. Bischofs, W. Hasselbring","doi":"10.1109/PDP.2007.70","DOIUrl":"https://doi.org/10.1109/PDP.2007.70","url":null,"abstract":"In the process of developing P2P systems simulation has proved to be an essential tool for the evaluation of existing and conceived P2P systems. So far, in practice there has been a clear separation between a simulation model of a P2P system and a real P2P system that operates on a real physical network. This separation hinders the transition of models to real systems and the evaluation of already deployed systems by means of simulation. This work tries to bridge this gap by proposing a methodology and a framework for the simulation-based development of P2P systems. In this approach, an initial model of a P2P system is iteratively transformed into the intended real P2P system. The presented framework effectively supports a developer in modelling, simulating and ultimately developing P2P systems. The authors demonstrate the validity of the approach and the framework by constructing an example P2P application. This application is simulated in a series of experiments as well as deployed in a large-scale Internet based P2P system","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"260 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114443544","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":"Activity Pre-Scheduling in Grid Workflows","authors":"Giancarlo Tretola, E. Zimeo","doi":"10.1109/PDP.2007.15","DOIUrl":"https://doi.org/10.1109/PDP.2007.15","url":null,"abstract":"Grid computing is becoming a prominent field of interest for distributed systems. The capability to support resource sharing between different organizations and the high level of performance are noteworthy features. However, to define, deploy and execute grid applications require significant design effort and complex resource coordination, which can be alleviated by using workflow management systems. This technology is more and more adopted in distributed systems and grids since it ensures easiness and flexibility at design-time and performance and dynamicity at run-time. This paper gives a contribution to performance improvements of workflow by presenting a technique to exploit fine-grained concurrency at run-time. The technique is implemented in a workflow enactment service that dynamically optimizes process execution limiting the design effort of application developers","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117352366","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 Effective Starvation Avoidance Mechanism to Enhance the Token Coherence Protocol","authors":"B. Cuesta, A. Robles, J. Duato","doi":"10.1109/PDP.2007.22","DOIUrl":"https://doi.org/10.1109/PDP.2007.22","url":null,"abstract":"Shared-memory multiprocessors are becoming to be formed by an increasingly larger number of nodes. In these systems, implementing cache coherence is a key issue. Token coherence is a low latency cache coherence protocol that avoids indirection for cache-to-cache misses and which does not require a totally-ordered interconnect. When races are rare, the protocol performs well thanks to the performance policy. Unfortunately, some medium/large systems and some applications that often access the same data simultaneously make races more common. As a result, the protocol does not perform as well as it could because it uses the persistent request mechanism to prevent starvation. This mechanism is too slow and inflexible because it overrides the performance policy. In consequence, the protocol slows down the system and does not take advantage of the flexibility and speed of the common case. We propose a new mechanism, namely priority requests, which replaces the persistent request one. Our mechanism solves races, while still respecting the performance policy, simply by ordering and giving a higher priority to requests suffering from starvation. Thus, our mechanism handles the tokens more efficiently and reduces the network traffic","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121469166","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}
Miguel A. Gomez-Hernandez, Juan I. Asensio-Pérez, E. Gómez-Sánchez, Miguel L. Bote-Lorenzo, Y. Dimitriadis
{"title":"A High-Level Reference Model for Reusable Object-Level Coordination Support in Groupware Applications","authors":"Miguel A. Gomez-Hernandez, Juan I. Asensio-Pérez, E. Gómez-Sánchez, Miguel L. Bote-Lorenzo, Y. Dimitriadis","doi":"10.1109/PDP.2007.9","DOIUrl":"https://doi.org/10.1109/PDP.2007.9","url":null,"abstract":"The success of groupware software largely depends on its capability for being reused in different collaborative scenarios without requiring significant software development efforts or user technical involvement. During the last decade several toolkits, frameworks, and specialized middleware software layers have been proposed as potential solutions to the groupware reusability problem. Those solutions cover common groupware functionality such as group formation and management, group awareness, shared workspace management, etc. This paper is focused on the reusable support to one of these common functionalities: the so-called object-level coordination that deals with multiple participants' sequential or simultaneous access to the same set of shared objects in a collaborative setting. The paper compares existing object-level coordination proposals and analyzes their capabilities and level of reuse. Starting from that analysis, and using a bottom-up approach, the paper also proposes a high-level reference model that identifies the desirable set of required functional elements, as well as their relationships, that reusable object-level coordination support should contain. The purpose of this reference model is twofold: to be used as a comparison framework for analyzing existing or yet-to-come object-level coordination building blocks; and, to be used as a starting point for developing new object-level coordination solutions (or redesigning existing ones) satisfying the whole set of requirements implicitly collected in the model. In addition to detailing the proposed reference model, the paper also illustrates and discusses both potential ways of using it","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122060108","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":"Towards On-Demand Ubiquitous Metascheduling on Computational Grids","authors":"J. M. Alonso, V. Hernández, Germán Moltó","doi":"10.1109/PDP.2007.80","DOIUrl":"https://doi.org/10.1109/PDP.2007.80","url":null,"abstract":"Grid computing technologies are mature enough to be successfully applied to computationally intensive scientific applications. However, the current process of applying grid computing to them is still hard and difficult for the least experienced users. In this paper we describe the adaptations made to the GMarte metascheduling framework in order to provide an ubiquitous access to its functionality as an efficient resource broker for the execution of tasks on computational grids. A metascheduling component accessible by only means of a Java-enabled Web browser has been developed, requiring almost zero configuration by the client. This approach has enabled to produce a generic multi-platform metascheduler which can be automatically deployed in the clients interested in resource brokering on computational grids based on the Globus Toolkit","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125615932","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":"Communication Study and Implementation Analysis of Parallel Asynchronous Iterative Algorithms on Message Passing Architectures","authors":"D. E. Baz","doi":"10.1109/PDP.2007.31","DOIUrl":"https://doi.org/10.1109/PDP.2007.31","url":null,"abstract":"The implementation of parallel asynchronous iterative algorithms on message passing architectures is considered. Several issues related to communication via message passing interfaces or libraries such as MPI-1, MPI-2, PVM or SHMEM are discussed in this survey paper. Practical implementations are proposed","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128496800","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":"Scheduling and Data Redistribution Strategies on Star Platforms","authors":"L. Marchal, V. Rehn-Sonigo, Y. Robert, F. Vivien","doi":"10.1109/PDP.2007.72","DOIUrl":"https://doi.org/10.1109/PDP.2007.72","url":null,"abstract":"In this work we are interested in the problem of scheduling and redistributing data on master-slave platforms. We consider the case were the workers possess initial loads, some of which having to be redistributed in order to balance their completion times. We assume that the data consists of independent and identical tasks. As the general case is NP-complete in the strong sense, we propose three heuristics. Simulations consolidate the theoretical results","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124734506","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}
M. Goyeneche, J. Villadangos, J. J. Astrain, Manuel Prieto, A. Córdoba
{"title":"A Distributed Data Gathering Algorithm for Wireless Sensor Networks with Uniform Architecture","authors":"M. Goyeneche, J. Villadangos, J. J. Astrain, Manuel Prieto, A. Córdoba","doi":"10.1145/1163610.1163639","DOIUrl":"https://doi.org/10.1145/1163610.1163639","url":null,"abstract":"Wireless sensor networks (WSNs) are commonly used for continuously monitoring applications. Data gathering and in-network processing are techniques to efficiently gather the information from sensor nodes. Usually, these techniques have been analyzed taking into account a global knowledge of the system in order to select the best path to gather the information or to establish a routing function. In this paper we propose a novel distributed data gathering algorithm for wireless networks and evaluate the effect of having a different number of cluster heads transmitting to the base station. We focus the attention on uniformly distributed nodes in a given area to evaluate the effects on the energy consumption. Our proposal distributes uniformly the energy consumption between the complete set of sensors in the system resulting in a similar longevity for all sensors in the system","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114674279","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}