A. Binzenhöfer, T. Hossfeld, Gerald Kunzmann, Kolja Eger
{"title":"Efficient Simulation of Large-Scale P2P Networks: Compact Data Structures","authors":"A. Binzenhöfer, T. Hossfeld, Gerald Kunzmann, Kolja Eger","doi":"10.1109/PDP.2007.41","DOIUrl":"https://doi.org/10.1109/PDP.2007.41","url":null,"abstract":"One of the most important design goals of current peer-to-peer (P2P) technology is to be able to offer its service to an arbitrary large number of users. Discrete event simulation is often applied to quantitatively and qualitatively evaluate the performance and scalability of such systems before they are deployed. However, the number of users, processes and events which can be simulated is limited by both the central memory and the time available. In this paper we present compact data structures and event design algorithms, which are intended to be a further step towards efficient simulation of large scale P2P systems. In particular, we give guidelines on how to increase the number of peers which can be simulated and show how to find a good tradeoff between computational time and memory consumption in large scale P2P simulation","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"61 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":"129872525","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":"Pretenuring in Java by Object Lifetime and Reference Density Using Scratch-Pad Memory","authors":"K. F. Chong, C. Ho, A. Fong","doi":"10.1109/PDP.2007.67","DOIUrl":"https://doi.org/10.1109/PDP.2007.67","url":null,"abstract":"Java has become a popular paradigm in software development. It is widely used in embedded systems and network computing because of its excellent robustness, modularity and security. Its built-in garbage collection automatically reclaims unused memory space. Current generational garbage collector works well with programs containing massive shortlived objects. However, the existence of hot-mature (i.e. frequently-accessed and long-lived) objects inhibits object reclamation. In this paper, we present two methodologies to exploit the locality for these objects. Firstly, we employ an on-chip scratchpad memory in memory hierarchy to preserve young and hot-mature objects. This reduces energy consumption and data accessing cycles for Java execution. Secondly, we introduce a pretenuring technique to segregate objects into separated memory regions based on the object lifetimes and reference densities, which minimizes the amount of object copying during garbage collections","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"103 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":"124086951","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}
Gerald Kunzmann, R. Nagel, T. Hossfeld, A. Binzenhöfer, Kolja Eger
{"title":"Efficient Simulation of Large-Scale P2P Networks: Modeling Network Transmission Times","authors":"Gerald Kunzmann, R. Nagel, T. Hossfeld, A. Binzenhöfer, Kolja Eger","doi":"10.1109/PDP.2007.42","DOIUrl":"https://doi.org/10.1109/PDP.2007.42","url":null,"abstract":"The ongoing process of globalization leads to a huge demand for highly scalable applications that are able to deal with millions of participants distributed all over the world. Peer-to-peer (P2P) technology enables an arbitrary large number of users to participate in distributed services like content distribution or collaboration tools. In order to verify a new protocol's performance and scalability simulation is a commonly used tool. First, predicting the network and peer behavior in the real world is only feasible if the simulation, i.e. all applied models as well as the peer state, is as realistic as possible. Second, many properties of the system only become observable when the number of participants is sufficiently large. Therefore, verifying the scalability of a system requires simulating huge worldwide networks. Due to limited processing power, central memory and availabe time, both requirements can only be fullfilled if the applied models are very efficient. In this paper we take a closer look at the network layer. We compare the most commonly-used network models and present a very efficient model for applying real-world network transmission times in large scale simulations","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"69 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":"127635940","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 Hierarchical Radiosity Method with Scene Distribution","authors":"Emilio J. Padrón, M. Amor, M. Bóo, R. Doallo","doi":"10.1109/PDP.2007.8","DOIUrl":"https://doi.org/10.1109/PDP.2007.8","url":null,"abstract":"Nowadays, one of the most active areas of research in computer graphics is focused on improving the performance of global illumination methods. In this paper we present a new parallel method for hierarchical radiosity computation. Contrary to usual solutions in the literature our approach carries out an effective partitioning and distribution of the input geometry among the processors. Thus, the memory constraint is reduced when processing large scenes. The method presented in this paper also introduces a multi-thread scheduling to improve interaction between processors. This solution replaces the polling strategy usually used in parallel computing, when several independent tasks need to establish asynchronous communication. The great flexibility of our parallel implementation has been demonstrated by the good results achieved on a testbed with different computing systems and test scenes","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"31 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":"125877744","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":"pDomus: a prototype for Cluster-oriented Distributed Hash Tables","authors":"J. Rufino, A. Alves, J. Exposto, A. Pina","doi":"10.1109/PDP.2007.62","DOIUrl":"https://doi.org/10.1109/PDP.2007.62","url":null,"abstract":"The Domus architecture for distributed hash tables (DHTs) is specially designed to support the concurrent deployment of multiple and heterogeneous DHTs, in a dynamic shared-all cluster environment. The execution model is compatible with the simultaneous access of several distributed/parallel client applications to the same or different running DHTs. Support to distributed routing and storage is dynamically configurable per node, as a function of applications requirements, node base resources and the overall cluster communication, memory and storage usage. pDomus is a prototype of Domus that creates an environment where to evaluate the model embedded concepts and planned features. In this paper, we present a series of experiments conduced to obtain figures of merit i) for the performance of basic dictionary operations, and ii) for the storage overhead resulting from several storage technologies. We also formulate a ranking formula that takes into account access patterns of clients to DHTs, to objectively select the most adequate storage technology, as a valuable metric for a wide range of application scenarios. Finally, we also evaluate client applications and services scalability, for a select dictionary operation. Results of the overall evaluation are promising and a motivation for further work","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"169 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":"126130919","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 Detection of Targets in Hyperspectral Images Using Heterogeneous Networks of Workstations","authors":"A. Plaza, D. Valencia, Soraya Blazquez, J. Plaza","doi":"10.1109/PDP.2007.60","DOIUrl":"https://doi.org/10.1109/PDP.2007.60","url":null,"abstract":"Heterogeneous networks of workstations have rapidly become a cost-effective computing solution in many application areas. This paper develops several highly innovative parallel algorithms for target detection in hyperspectral imagery, considered to be a crucial goal in remote sensing-based homeland security and defense applications. In order to illustrate parallel performance, we consider four (partially and fully) heterogeneous networks of workstations distributed among different locations at University of Maryland, and also a massively parallel Beowulf cluster at NASA's Goddard Space Flight Center. Experimental results indicate that heterogeneous networks can be used as a viable low-cost alternative to homogeneous parallel systems in many on-going and planned remote sensing missions","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"26 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":"128607011","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}
G. Aiello, M. Alessi, M. Cossentino, P. Storniolo, A. Urso
{"title":"DNK-WSD: A Distributed Approach for Knowledge Discovery in Peer to Peer Networks","authors":"G. Aiello, M. Alessi, M. Cossentino, P. Storniolo, A. Urso","doi":"10.1109/PDP.2007.38","DOIUrl":"https://doi.org/10.1109/PDP.2007.38","url":null,"abstract":"Service oriented architectures (SOA) represent a recent proposal to obtain cooperation and interoperability in distributed computing environments. A challenge of SOA is services and resources discovery which can be realized both in centralized and distributed way. The distributed approach involves peer-to-peer (P2P) infrastructures supporting the knowledge distribution among peers. In this paper we propose DNK-WSD, a new network architecture providing an efficient distributed Web service and resource discovery mechanism based on the notification pattern. The DNK network is a peer-to-peer architecture built using the distributed network knowledge (DNK) heuristic which represents a lightweight approach to model graphs mapping logical P2P overlay networks. A case study, regarding the deployment of DNK-WSD for information sharing in real time collaborative Web applications, demonstrates the validity of DNK-WSD in terms of fast propagation of the shared data, low network load and reliability","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"41 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":"128659651","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":"Scalable Content-Based Publish/Subscribe Services over Structured Peer-to-Peer Networks","authors":"Xiaoyu Yang, Yingwu Zhu, Yimin Hu","doi":"10.1109/PDP.2007.71","DOIUrl":"https://doi.org/10.1109/PDP.2007.71","url":null,"abstract":"The scalability has remained a challenge in the design of distributed publish/subscribe systems. In this paper we propose a novel solution to address this problem in content-based pub/sub systems on top of distributed hash table. The main objective is to ensure an appropriate amount of rendezvous point nodes in the system, as well as maintain an even load distribution among them. An attribute-vector based publish/subscribe scheme and related load balancing mechanisms (ID space partitioning, attribute grouping, dynamic ID space split-merge) are proposed to achieve this goal. The experimental results show that our approaches can achieve a good scalability by efficiently distribute/balance load among an adaptive quantity of rendezvous point nodes, while retaining very small overhead and latency","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"42 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":"130625351","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":"SLOSL--A Modelling Language for Topologies and Routing in Overlay Networks","authors":"Stefan Behnel","doi":"10.1109/PDP.2007.75","DOIUrl":"https://doi.org/10.1109/PDP.2007.75","url":null,"abstract":"Overlay networks are a fascinating field in the area of distributed systems. They combine challenges from self-organisation to extreme scalability and provide an interesting middleware layer for server-free Internet applications. The design aspects of their implementations, however, remained largely at the prototype level, which renders their integration and deployment in real applications hard. This paper describes an integrative, platform independent design approach for overlay networks that models topologies as data management systems. Local decisions about neighbours and message forwarding are expressed in an SQL-like language. The mapping to runnable implementations follows the model driven architecture approach","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":"123780690","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":"Dynamic Distribution and Execution of Tasks in Pervasive Grids","authors":"A. Coronato, G. Pietro, Luigi Gallo","doi":"10.1109/PDP.2007.39","DOIUrl":"https://doi.org/10.1109/PDP.2007.39","url":null,"abstract":"Grid computing and pervasive computing have rapidly emerged and affirmed respectively as the paradigm for high performance computing and the paradigm for user-friendly computing. The conjunction of such paradigms are now generating a new one, the pervasive grid computing, which aims at extending classic grids with characteristics of pervasive computing like spontaneous and transparent integration of mobile devices, context-awareness, pro-activity, and so on. In this paper, we present a software infrastructure for integrating mobile devices as active resources in a grid. In particular, it has been developed a service able to dynamically distribute and execute user's tasks on a grid of mobile and fixed devices. Mobile devices participate to the grid in a way completely transparent to their owners, hence the computational power is given without any configuration operation and in a reliable way. As well, users willing of executing their applications directly submit their code without caring of choosing and allocating resources of the grid","PeriodicalId":357699,"journal":{"name":"15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)","volume":"193 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":"132091341","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}