发布求助
文献互助 智能选刊 最新文献

2009 Eighth International Symposium on Parallel and Distributed Computing最新文献

筛选
英文 中文
Exploration of the Conjecture of Bateman Using Particle Swarm Optimisation and Grid Computing 利用粒子群优化和网格计算探索贝特曼猜想
2009 Eighth International Symposium on Parallel and Distributed Computing Pub Date : 2009-06-30 DOI: 10.1109/ISPDC.2009.13
M. Cárdenas-Montes, A. Gómez-Iglesias, M. A. Vega-Rodríguez, Enrique Morales-Ramos
{"title":"Exploration of the Conjecture of Bateman Using Particle Swarm Optimisation and Grid Computing","authors":"M. Cárdenas-Montes, A. Gómez-Iglesias, M. A. Vega-Rodríguez, Enrique Morales-Ramos","doi":"10.1109/ISPDC.2009.13","DOIUrl":"https://doi.org/10.1109/ISPDC.2009.13","url":null,"abstract":"The Particle Swarm Optimisation concept is an evolutionary computation technique employed to find optimal solutions in problems with immense solution space. In this article, an application of Particle Swarm Optimisation technique to the survey of the Conjecture of Bateman is presented. The Conjecture of Bateman requests how many coincidences of sums of powers of prime numbers are. Up today, only one coincidence has been proved. Neither previous exploration of the Conjecture has been published in the scientific literature, nor analytical demonstration has proved the existence of a finite or infinite number of coincidences. In a previous and systematic exploration, not new coincidences have appeared. Unfortunately, the size of the Conjecture makes impossible to go on this brute-force and systematic survey. In order to support the exploration, a gLite grid computing infrastructure has been used, providing seamless access to computational resources.","PeriodicalId":226126,"journal":{"name":"2009 Eighth International Symposium on Parallel and Distributed Computing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125285299","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}
引用次数: 1
An Efficient Weak Mutual Exclusion Algorithm 一种高效的弱互斥算法
2009 Eighth International Symposium on Parallel and Distributed Computing Pub Date : 2009-06-30 DOI: 10.1109/ISPDC.2009.32
P. Romano, L. Rodrigues
{"title":"An Efficient Weak Mutual Exclusion Algorithm","authors":"P. Romano, L. Rodrigues","doi":"10.1109/ISPDC.2009.32","DOIUrl":"https://doi.org/10.1109/ISPDC.2009.32","url":null,"abstract":"The Weak Mutual Exclusion (WME) is a recently proposed abstraction which, analogously to classical Distributed Mutual Exclusion (DME), permits to serialize concurrent accesses to a shared resource. Unlike DME, however, the WME abstraction regulates the access to a replicated shared resource and is solvable in the presence of less restrictive synchrony assumptions, i.e. in an asynchronous system augmented with an eventually perfect failure detector. This paper presents an efficient WME algorithm which outperforms previous solutions in terms of both communication latency and message complexity, while relying on minimal synchrony assumptions.","PeriodicalId":226126,"journal":{"name":"2009 Eighth International Symposium on Parallel and Distributed Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114916423","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}
引用次数: 2
A Dynamic Model for Fire Emergency Evacuation Based on Wireless Sensor Networks 基于无线传感器网络的火灾应急疏散动态模型
2009 Eighth International Symposium on Parallel and Distributed Computing Pub Date : 2009-06-30 DOI: 10.1109/ISPDC.2009.33
T. Tabirca, Kenneth N. Brown, C. Sreenan
{"title":"A Dynamic Model for Fire Emergency Evacuation Based on Wireless Sensor Networks","authors":"T. Tabirca, Kenneth N. Brown, C. Sreenan","doi":"10.1109/ISPDC.2009.33","DOIUrl":"https://doi.org/10.1109/ISPDC.2009.33","url":null,"abstract":"This work introduces a dynamic model for the fire emergency evacuation problem. The model extends the concept safety introduced by Barnes et.al. for the situation when the navigation graph is dynamic. The two possible scenarios are described for using the dynamic model with a Wireless Sensor Network for fire emergency evacuation.","PeriodicalId":226126,"journal":{"name":"2009 Eighth International Symposium on Parallel and Distributed Computing","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122562050","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}
引用次数: 54
Admission Control for Distributed Complex Responsive Systems 分布式复杂响应系统的准入控制
2009 Eighth International Symposium on Parallel and Distributed Computing Pub Date : 2009-06-30 DOI: 10.1109/ISPDC.2009.10
L. Garcés-Erice
{"title":"Admission Control for Distributed Complex Responsive Systems","authors":"L. Garcés-Erice","doi":"10.1109/ISPDC.2009.10","DOIUrl":"https://doi.org/10.1109/ISPDC.2009.10","url":null,"abstract":"The software in modern systems has become too complex to make accurate predictions about their performance under different configurations. Real-time or even responsiveness requirements cannot be met because it is not possible to perform admission control for new or changing tasks if we cannot tell how their execution affects the other tasks already running. Previously, we proposed a resource-allocation middleware that manages the execution of tasks in a complex distributed system with real-time requirements. The middleware behavior can be modeled depending on the configuration of the tasks running, so that the performance of any given configuration can be calculated. This makes it possible to have admission control in such a system, but the model requires knowledge of run-time parameters. We propose the utilization of machine-learning algorithms to obtain the model parameters, and be able to predict the system performance under any configuration, so that we can provide a full admission control mechanism for complex software systems.","PeriodicalId":226126,"journal":{"name":"2009 Eighth International Symposium on Parallel and Distributed Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123843244","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}
引用次数: 6
Programming Abstractions and Toolchain for Dataflow Multithreading Architectures 数据流多线程体系结构的编程抽象和工具链
2009 Eighth International Symposium on Parallel and Distributed Computing Pub Date : 2009-06-30 DOI: 10.1109/ISPDC.2009.35
Kyriakos Stavrou, Demos Pavlou, Marios Nikolaides, P. Petrides, P. Evripidou, P. Trancoso, Z. Popovic, R. Giorgi
{"title":"Programming Abstractions and Toolchain for Dataflow Multithreading Architectures","authors":"Kyriakos Stavrou, Demos Pavlou, Marios Nikolaides, P. Petrides, P. Evripidou, P. Trancoso, Z. Popovic, R. Giorgi","doi":"10.1109/ISPDC.2009.35","DOIUrl":"https://doi.org/10.1109/ISPDC.2009.35","url":null,"abstract":"The need to exploit multi-core systems for parallel processing has revived the concept of dataflow. In particular, the Dataflow Multithreading architectures have proven to be good candidates for these systems. In this work we propose an abstraction layer that enables compiling and running a program written for an abstract Dataflow Multithreading architecture on different implementations. More specifically, we present a set of compiler directives that provide the programmer with the means to express most types of dependencies between code segments. In addition, we present the corresponding toolchain that transforms this code into a form that can be compiled for different implementations of the model. As a case study for this work, we present the usage of the toolchain for the TFlux and DTA architectures.","PeriodicalId":226126,"journal":{"name":"2009 Eighth International Symposium on Parallel and Distributed Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128825784","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}
引用次数: 21
Parallel Position Weight Matrices Algorithms 平行位置权重矩阵算法
2009 Eighth International Symposium on Parallel and Distributed Computing Pub Date : 2009-06-30 DOI: 10.1109/ISPDC.2009.31
Mathieu Giraud, Jean-Stéphane Varré
{"title":"Parallel Position Weight Matrices Algorithms","authors":"Mathieu Giraud, Jean-Stéphane Varré","doi":"10.1109/ISPDC.2009.31","DOIUrl":"https://doi.org/10.1109/ISPDC.2009.31","url":null,"abstract":"Position Weight Matrices (PWMs) are broadly used in computational biology. The basic problem, SCAN, aims to find the occurrences of a given PWM in large sequences. Some other PWM tasks share a common NP-hard subproblem, SCOREDISTRIBUTION. The existing algorithms rely on the enumeration on a large set of scores or words, and they are mostly not suitable for parallelization.We propose a new algorithm, BUCKETSCOREDISTRIBUTION, that is both very efficient and suitable for parallelization.We bound the error induced by this algorithm. We realized a GPU prototype for SCAN and BUCKETSCOREDISTRIBUTION with the CUDA libraries, and report for the different problems speedups of 21x and 77x on a Nvidia GTX 280.","PeriodicalId":226126,"journal":{"name":"2009 Eighth International Symposium on Parallel and Distributed Computing","volume":"90 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114418453","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}
引用次数: 12
Using a RESTful Messaging and Registry System to Support a Range a Distributed Applications 使用RESTful消息传递和注册系统支持一系列分布式应用程序
2009 Eighth International Symposium on Parallel and Distributed Computing Pub Date : 2009-06-30 DOI: 10.1109/ISPDC.2009.17
M. Baker, Garry Smith, M. Grove, R. Lakhoo, H. Mills, Carl Albing
{"title":"Using a RESTful Messaging and Registry System to Support a Range a Distributed Applications","authors":"M. Baker, Garry Smith, M. Grove, R. Lakhoo, H. Mills, Carl Albing","doi":"10.1109/ISPDC.2009.17","DOIUrl":"https://doi.org/10.1109/ISPDC.2009.17","url":null,"abstract":"Tycho was conceived in 2003 in response to a need by the GridRM [1] resource-monitoring project for a “light-weight”, scalable and easy to use wide-area distributed registry and messaging system. Since Tycho’s first release in 2006 a number of modifications have been made to the system to make it easier to use and more flexible. Since its inception, Tycho has been utilised across a number of application domains including widearea resource monitoring, distributed queries across archival databases, providing services for the nodes of a Cray supercomputer, and as a system for transferring multi-terabyte scientific datasets across the Internet. This paper provides an overview of the initial Tycho system, describes a number of applications that utilise Tycho, discusses a number of new utilities, and how the Tycho infrastructure has evolved in response to experience of building applications with it.","PeriodicalId":226126,"journal":{"name":"2009 Eighth International Symposium on Parallel and Distributed Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116029766","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}
引用次数: 0
TCP-AuthN: TCP Inline Authentication to Enhance Network Security in Grid Environments TCP- authn:提高网格环境下网络安全性的TCP内联认证
2009 Eighth International Symposium on Parallel and Distributed Computing Pub Date : 2009-06-30 DOI: 10.1109/ISPDC.2009.29
J. Wiebelitz, Christopher Kunz, S. Piger, C. Grimm
{"title":"TCP-AuthN: TCP Inline Authentication to Enhance Network Security in Grid Environments","authors":"J. Wiebelitz, Christopher Kunz, S. Piger, C. Grimm","doi":"10.1109/ISPDC.2009.29","DOIUrl":"https://doi.org/10.1109/ISPDC.2009.29","url":null,"abstract":"To secure communication in Grids many efforts have been made regarding authentication and authorization. Due to some application requirements it is up to now recommended to open wide port ranges on firewalls. This configuration is commonly accepted as insecure. We present an approach to enhance the security of firewalled Grid components by a new method to dynamically authorize TCP connections on firewalls. The authorization decision relies on the authenticated identity of users or conveyed attribute assertions. Authentication information is transferred within the TCP three-way-handshake. To distinguish the authentication information from application data a new TCP option tcpauthn is introduced. The new method TCP-AuthN leads to a new paradigm in firewall operation as the firewall comes to the final decision to allow or reject/deny a connection after the third segment of the TCP three-way-handshake is verified. The firewall denies/rejects each connection on an individual basis depending on the user's proven identity.","PeriodicalId":226126,"journal":{"name":"2009 Eighth International Symposium on Parallel and Distributed Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132299989","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}
引用次数: 6
A P2P Network of Space Containers for Efficient Management of Spatial-Temporal Data in Intelligent Transportation Scenarios 面向智能交通场景下时空数据高效管理的空间集装箱P2P网络
2009 Eighth International Symposium on Parallel and Distributed Computing Pub Date : 2009-06-30 DOI: 10.1109/ISPDC.2009.27
E. Kühn, Richard Mordinyi, Hannu-Daniel Goiss, S. Bessler, S. Tomic
{"title":"A P2P Network of Space Containers for Efficient Management of Spatial-Temporal Data in Intelligent Transportation Scenarios","authors":"E. Kühn, Richard Mordinyi, Hannu-Daniel Goiss, S. Bessler, S. Tomic","doi":"10.1109/ISPDC.2009.27","DOIUrl":"https://doi.org/10.1109/ISPDC.2009.27","url":null,"abstract":"The effectiveness of Intelligent Transportation Systems (ITS) depends on their ability to collect contextual data from various sources and appropriately generate and transport comprehensible, reliable and timely content to users. In such applications, the exchanged content is structured in space and time. Peer-to-peer(P2P) networks are the natural choice these applications due to their fault-tolerance, self-organization and scalability properties. However, a closer analysis of the available Distributed Hash Tables (DHT) protocols shows that the structure of the datagets lost and its short liveness leads to high signalling traffic. In this work we propose a novel overlay network of so called Space Containers for storing, accessing, manipulating and structuring dynamic geo-located content. The benefits of combining Space Containers and DHT are: clean application programming logic and efficient content retrieval while preserving the properties of DHTs. We describe the system architecture applied to a transportation scenario and show preliminary evaluation results.","PeriodicalId":226126,"journal":{"name":"2009 Eighth International Symposium on Parallel and Distributed Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123040779","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}
引用次数: 7
Connection Bundling with HTTP: Supporting Interactive Applications through Web Browsers 与HTTP的连接绑定:通过Web浏览器支持交互式应用程序
2009 Eighth International Symposium on Parallel and Distributed Computing Pub Date : 2009-06-30 DOI: 10.1109/ISPDC.2009.12
H. Rosmanith, J. Volkert
{"title":"Connection Bundling with HTTP: Supporting Interactive Applications through Web Browsers","authors":"H. Rosmanith, J. Volkert","doi":"10.1109/ISPDC.2009.12","DOIUrl":"https://doi.org/10.1109/ISPDC.2009.12","url":null,"abstract":"In a distributed environment, scientists using clusters, supercomputers, and the grid, may often find themselves in a place apart from the computing facilities. Therefore, controlling and steering interactive applications executing remotely requires a transport mechanism connecting the scientist's workstation with the remote computer. The concept presented in this paper only needs minimal prerequisites to fulfil this task. On the user side, a web browser executing a Java applet is sufficient, on the remote computer, a web server able to start the remote application is required. The \"connecting bundling'' method presented herein allows demanding remote interactive applications to be controlled even in a restrictive network environment.","PeriodicalId":226126,"journal":{"name":"2009 Eighth International Symposium on Parallel and Distributed Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127896858","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}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信