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

2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing最新文献

筛选
英文 中文
Analytical Modeling of the Energy Consumption for the High Performance Linpack 高性能Linpack的能耗分析建模
2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.56
Alberto Cabrera Pérez, F. Almeida, Vicente Blanco Pérez, D. Giménez
{"title":"Analytical Modeling of the Energy Consumption for the High Performance Linpack","authors":"Alberto Cabrera Pérez, F. Almeida, Vicente Blanco Pérez, D. Giménez","doi":"10.1109/PDP.2013.56","DOIUrl":"https://doi.org/10.1109/PDP.2013.56","url":null,"abstract":"Comparable to time performance models, it is now possible to estimate performance based upon energy consumption for HPC systems. The predictive ability of the analytical modeling is an interesting feature that motivates us to approach this methodology for the case of energy consumption. In this paper, we present an analytical model for predicting the energy consumption for the High Performance Linpack (HPL). The derived model can be used to know in advance the energy consumed by the HPL over a target architecture, and can be integrated into the schedulers of operating systems or queue managers. We established an experimental setup using a standard metered PDU that allowed us to measure the energy consumption for the HPL benchmark on our cluster. With the monitoring system in place, we can obtain the architectural and algorithmic parameters associated for both performance and energy analytical models. Also this has made possible watts and gflops-per-watt prediction when we execute Linpack executions with concrete algorithm parameters in our cluster.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129787475","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
Performance Evaluation of Container-Based Virtualization for High Performance Computing Environments 基于容器的高性能计算环境虚拟化性能评估
2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.41
Miguel G. Xavier, M. V. Neves, F. Rossi, T. Ferreto, T. Lange, C. Rose
{"title":"Performance Evaluation of Container-Based Virtualization for High Performance Computing Environments","authors":"Miguel G. Xavier, M. V. Neves, F. Rossi, T. Ferreto, T. Lange, C. Rose","doi":"10.1109/PDP.2013.41","DOIUrl":"https://doi.org/10.1109/PDP.2013.41","url":null,"abstract":"The use of virtualization technologies in high performance computing (HPC) environments has traditionally been avoided due to their inherent performance overhead. However, with the rise of container-based virtualization implementations, such as Linux VServer, OpenVZ and Linux Containers (LXC), it is possible to obtain a very low overhead leading to near-native performance. In this work, we conducted a number of experiments in order to perform an in-depth performance evaluation of container-based virtualization for HPC. We also evaluated the trade-off between performance and isolation in container-based virtualization systems and compared them with Xen, which is a representative of the traditional hypervisor-based virtualization systems used today.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"425 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132328076","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}
引用次数: 244
Dynamic Proliferation of Agents in a Multiple-Agent System 多agent系统中agent的动态扩散
2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.34
Peter Lavin, B. Coghlan
{"title":"Dynamic Proliferation of Agents in a Multiple-Agent System","authors":"Peter Lavin, B. Coghlan","doi":"10.1109/PDP.2013.34","DOIUrl":"https://doi.org/10.1109/PDP.2013.34","url":null,"abstract":"This paper describes developments in an already existing software agent technology which facilitates agent creation and configuration in relatively large numbers for the formation of a multiple-agent system or MAS. The work addresses the task of quick and easy proliferation of such an MAS in which agents can be added, removed, configured and reconfigured without impacting on other agents. Specification of the MAS is laid down in a number of machine-readable text files, on which a program or script executes to bring the system into being. The mechanism described here is simply a means to creating such an MAS and focuses on scalability and ease of specification and configuration. The agent software used is of modular design and has several internal features which are further exploited to allow these developments. In this work, the agents are hosted in standard web service containers and use network protocols for communications. The original architecture and features of the agents are preserved. Multiple technologies are brought together and tested in the successful creation of a 100 agents.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128705748","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
ILP-Based Communication Reduction for Heterogeneous 3D Network-on-Chips 基于ilp的异构三维片上网络通信缩减
2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.83
Ismail Akturk, O. Ozturk
{"title":"ILP-Based Communication Reduction for Heterogeneous 3D Network-on-Chips","authors":"Ismail Akturk, O. Ozturk","doi":"10.1109/PDP.2013.83","DOIUrl":"https://doi.org/10.1109/PDP.2013.83","url":null,"abstract":"Network-on-Chip (NoC) architectures and three-dimensional integrated circuits (3D ICs) have been introduced as attractive options for overcoming the barriers in interconnect scaling while increasing the number of cores. Combining these two approaches is expected to yield better performance and higher scalability. This paper explores the possibility of combining these two techniques in a heterogeneity aware fashion. We explore how heterogeneous processors can be mapped onto the given 3D chip area to minimize the data access costs. Our initial results indicate that the proposed approach generates promising results within tolerable solution times.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121764349","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
Distributed Ontology-Driven Focused Crawling 分布式本体驱动的集中爬行
2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.23
Rodrigo Campos, Oscar Rojas, Mauricio Marín, Marcelo Mendoza
{"title":"Distributed Ontology-Driven Focused Crawling","authors":"Rodrigo Campos, Oscar Rojas, Mauricio Marín, Marcelo Mendoza","doi":"10.1109/PDP.2013.23","DOIUrl":"https://doi.org/10.1109/PDP.2013.23","url":null,"abstract":"Focused crawlers are programs designed to download web pages which are relevant to specific topics. Using information gathered at running time, focused crawlers explore the web following promissory hyperlinks and fetching only pages which appear to be relevant. These crawlers are receiving increasing attention because they favor the construction of vertical search engines, allowing users to focus on specific topics of information, providing higher accuracy and reducing computational costs involved in query processing. In this article, we introduce an efficient focused crawling strategy which considers a number of distributed focused crawlers which recover relevant pages to a given knowledge domain. We propose an ontology-based knowledge representation approach to drive the crawler to specific segments of the web. Experimental results with actual samples of the Web show the feasibility and efficiency of our strategy.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"46 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128828068","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}
引用次数: 10
Efficient Cooperative Discovery of Service Compositions in Unstructured P2P Networks 非结构化P2P网络中服务组合的高效协同发现
2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.10
Angelo Furno, E. Zimeo
{"title":"Efficient Cooperative Discovery of Service Compositions in Unstructured P2P Networks","authors":"Angelo Furno, E. Zimeo","doi":"10.1109/PDP.2013.10","DOIUrl":"https://doi.org/10.1109/PDP.2013.10","url":null,"abstract":"In this paper, we propose an efficient technique for improving the performance of automatic and cooperative compositions in P2P unstructured networks during service discovery. Since the adoption of flooding to exchange queries and partial solutions among the peers of unstructured networks generates a huge amount of messages, the technique exploits a probabilistic forwarding algorithm that uses different sources of knowledge, such as network density and service grouping, to reduce the amount of messages exchanged. The technique, analyzed in several network configurations by using a simulator to observe resolution time, recall and message overhead, has shown good performances especially in dense and large-scale service networks.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122522780","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}
引用次数: 24
Quality of Service Optimization for Network-on-Chip Using Bandwidth-Constraint Mapping Algorithm 基于带宽约束映射算法的片上网络服务质量优化
2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.81
A. Eskandari, A. Khademzadeh, N. Bagherzadeh, Majid Janidarmian
{"title":"Quality of Service Optimization for Network-on-Chip Using Bandwidth-Constraint Mapping Algorithm","authors":"A. Eskandari, A. Khademzadeh, N. Bagherzadeh, Majid Janidarmian","doi":"10.1109/PDP.2013.81","DOIUrl":"https://doi.org/10.1109/PDP.2013.81","url":null,"abstract":"In this paper, we propose a novel mapping algorithm for providing Quality of Service (QoS) under bandwidth constraints in 3D Network-on-Chip (NoC). The QoS is warranted in such a way that all minimum feasible paths considering the required and available bandwidth are explored by the mapping algorithm. The maximum required bandwidth on the network links for this mapping algorithm is compared with other methods such as NMAP, Onyx and Citrine while applied on two video processing applications i.e. VOPD (Video Object Plane Decoder) and MPEG-4. The available bandwidth of vertical and horizontal links are considered the same and different in the experimental results.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"327 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116002047","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}
引用次数: 3
Improved Reachability Analysis for Security Management 改进的安全管理可达性分析
2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.86
C. Basile, D. Canavese, A. Lioy, Christian Pitscheider
{"title":"Improved Reachability Analysis for Security Management","authors":"C. Basile, D. Canavese, A. Lioy, Christian Pitscheider","doi":"10.1109/PDP.2013.86","DOIUrl":"https://doi.org/10.1109/PDP.2013.86","url":null,"abstract":"Network reachability analysis evaluates the actual connectivity of an IT infrastructure. It can be performed by active network probing or examining a formal model of a target IT infrastructure. The latter approach is preferable as it does not interfere with the normal network behaviour and can be easily used during development and change management phases. In this paper we propose a novel modelling approach based on a geometric representation of device configurations (i.e. the policies) which allows the computation of the reachability analysis using the concept of equivalent firewall. An equivalent firewall is a fictitious device, ideally connected directly to the communication endpoints, that summarizes the network behaviour between them. Our model supports routing, filtering and address translation devices in a computationally effective way. In fact, the experimental results show that the computation of equivalent firewalls is performed in a negligible time and that then the reachability queries are answered in few seconds.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124844865","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
Service Deployment Algorithms for Vertical Search Engines 垂直搜索引擎的服务部署算法
2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.28
V. Gil-Costa, Alonso Inostrosa-Psijas, Mauricio Marín, E. Feuerstein
{"title":"Service Deployment Algorithms for Vertical Search Engines","authors":"V. Gil-Costa, Alonso Inostrosa-Psijas, Mauricio Marín, E. Feuerstein","doi":"10.1109/PDP.2013.28","DOIUrl":"https://doi.org/10.1109/PDP.2013.28","url":null,"abstract":"Web search engines are systems devised to cope with highly dynamic and demanding query rates. These systems are composed by several services, each one dedicated to execute a single operation required to solve a query. Services are allocated into thousand of multi-core processors organized in racks. Some services communicate more than others, so it is desirable to put them in the same rack. In this work, we present and evaluate deployment algorithms for a web search engine. In particular, we focus on vertical search engines with specific on-line content which may include shopping, advertisement, etc.. Our goal is to improve the performance of a search engine by reducing communication time. Communication among services is performed by means of a fast and complex network supporting parallel sending and receiving of messages. We propose a communication-graph-based method, in which processors are the nodes of the graph and communication between them is represented as weighted arcs. Results show that our proposal method is able to reduce maximum query response time.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129997768","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}
引用次数: 8
A RISC Building Block Set for Structured Parallel Programming 面向结构化并行编程的RISC构建块集
2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2013-02-27 DOI: 10.1109/PDP.2013.17
M. Danelutto, M. Torquati
{"title":"A RISC Building Block Set for Structured Parallel Programming","authors":"M. Danelutto, M. Torquati","doi":"10.1109/PDP.2013.17","DOIUrl":"https://doi.org/10.1109/PDP.2013.17","url":null,"abstract":"We propose a set of building blocks (RISC-pb2l) suitable to build high-level structured parallel programming frameworks. The set is designed following a RISC approach. RISC-pb2l is architecture independent but the implementation of the different blocks may be specialized to make the best usage of the target architecture peculiarities. A number of optimizations may be designed transforming basic building blocks compositions into more efficient compositions, such that parallel application efficiency may be derived by construction rather than by debugging.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132233554","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}
引用次数: 9
首页 上一页 下一页 尾页
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学术官方微信