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

筛选
英文 中文
Bag of Tasks Rescheduling within Real Grid Environments: Different Approaches 真实网格环境中的任务重调度:不同的方法
Luis Tomás, María Blanca Caminero, C. Carrión
{"title":"Bag of Tasks Rescheduling within Real Grid Environments: Different Approaches","authors":"Luis Tomás, María Blanca Caminero, C. Carrión","doi":"10.1109/PDP.2013.38","DOIUrl":"https://doi.org/10.1109/PDP.2013.38","url":null,"abstract":"Providing Quality of Service (QoS) in Grid environments is still a challenging task because advance reservation of resources is not always possible. By contrast, scheduling the use of resources in advance is a way of enhancing the provision of QoS, without physically reserving them. However, in a Grid scenario fragmentation may appear as a logic result of the allocation process, leading to poor resource utilization. To try to avoid that problem a rescheduling technique has been developed and applied periodically depending on the existing fragmentation. Nevertheless, reallocating jobs in an optimal way is an NP-Hard problem. Consequently, simple and scalable ways of distributing and allocating those jobs into the resources are presented and evaluated in a real Grid environment involving heterogeneous computing resources distributed across different national organizations, highlighting the benefits of using them to increase the resource usage.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"46 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":"128518535","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
CPNoC: On Using Constraint Programming in Design of Network-on-Chip Architecture 约束规划在片上网络结构设计中的应用
A. Demiriz, N. Bagherzadeh, Abdulaziz Alhussien
{"title":"CPNoC: On Using Constraint Programming in Design of Network-on-Chip Architecture","authors":"A. Demiriz, N. Bagherzadeh, Abdulaziz Alhussien","doi":"10.1109/PDP.2013.78","DOIUrl":"https://doi.org/10.1109/PDP.2013.78","url":null,"abstract":"NoC technology is composed of switched-based interconnections, where the communication resources are shared. Therefore, the optimal resource utilization is a crucial consideration for the efficient architecture designs. Application mapping and scheduling are important optimization problems. This paper studies the practicality of the Constraint Programming (CP) models on NoC architecture designs that effectively use a regular mesh with wormhole switching and the XY routing. The complexity of the CP models is compared to the earlier Mixed Integer Programming (MIP) models. Practical CP-based mapping and scheduling models are developed and the results are reported on the benchmark datasets. The results indicate that mapping and scheduling problems can be solved at near optimality even under relatively shorter run-time limits compared to those required by the MIP models.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"65 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":"133953735","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}
引用次数: 5
Using GPU for Multi-Agent Soil Simulation 基于GPU的多主体土壤模拟
Guillaume Laville, Kamel Mazouzi, C. Lang, L. Philippe, N. Marilleau
{"title":"Using GPU for Multi-Agent Soil Simulation","authors":"Guillaume Laville, Kamel Mazouzi, C. Lang, L. Philippe, N. Marilleau","doi":"10.1109/PDP.2013.63","DOIUrl":"https://doi.org/10.1109/PDP.2013.63","url":null,"abstract":"Multi-Agent Systems (MAS) can be used to model systems where the global behavior cannot be uniformly represented by standard techniques such as partial differential equations or linear systems because the system elements have their own independent behavior. This is, for instance, the case in complex systems such as daily mobility in a city for example. Depending on the system size the computing power needs for the MAS may be as big as for more traditional linear numerical systems and may need to be parallelized to fully represent real systems. Graphical Processing Units (GPU) have already proven to be an efficient support to execute large linear programs. In this paper we present the use of GPU for the execution of Sworm, a multi-scale MAS system. We show that GPU computing can be efficient in that less regular case and when the agent behavior is simple. We advocate for a wider use of the GPU in Agent Based Models in particular for multi-scale systems with work distribution between the CPU and GPU.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"43 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":"131493422","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
Mapping Tightly-Coupled Applications on Volatile Resources 在易失性资源上映射紧密耦合的应用
H. Casanova, F. Dufossé, Y. Robert, F. Vivien
{"title":"Mapping Tightly-Coupled Applications on Volatile Resources","authors":"H. Casanova, F. Dufossé, Y. Robert, F. Vivien","doi":"10.1109/PDP.2013.26","DOIUrl":"https://doi.org/10.1109/PDP.2013.26","url":null,"abstract":"Platforms that comprise volatile processors, such as desktop grids, have been traditionally used for executing independent-task applications. In this work we study the scheduling of tightly-coupled iterative master-worker applications onto volatile processors. The main challenge is that workers must be simultaneously available for the application to make progress. We consider two additional complications: one should take into account that workers can become temporarily reclaimed and, for data-intensive applications, one should account for the limited bandwidth between the master and the workers. In this context, our first contribution is a theoretical study of the scheduling problem in its off-line version, i.e., when processor availability is known in advance. Even in this case the problem is NP-hard. Our second contribution is an analytical approximation of the expectation of the time needed by a set of workers to complete a set of tasks and of the probability of success of this computation. This approximation relies on a Markovian assumption for the temporal availability of processors. Our third contribution is a set of heuristics, some of which use the above approximation to favor reliable processors in a sensible manner. We evaluate these heuristics in simulation. We identify some heuristics that significantly outperform their competitors and derive heuristic design guidelines.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"66 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":"132022403","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
Performance Traps in OpenCL for CPUs OpenCL的cpu性能陷阱
Jie Shen, Jianbin Fang, H. Sips, A. Varbanescu
{"title":"Performance Traps in OpenCL for CPUs","authors":"Jie Shen, Jianbin Fang, H. Sips, A. Varbanescu","doi":"10.1109/PDP.2013.16","DOIUrl":"https://doi.org/10.1109/PDP.2013.16","url":null,"abstract":"With its design concept of cross-platform portability, OpenCL can be used not only on GPUs (for which it is quite popular), but also on CPUs. Whether porting GPU programs to CPUs, or simply writing new code for CPUs, using OpenCL brings up the performance issue, usually raised in one of two forms: \"OpenCL is not performance portable!\" or \"Why using OpenCL for CPUs after all?!\". We argue that both issues can be addressed by a thorough study of the factors that impact the performance of OpenCL on CPUs. This analysis is the focus of this paper. Specifically, starting from the two main architectural mismatches between many-core CPUs and the OpenCL platform-parallelism granularity and the memory model-we identify eight such performance \"traps\" that lead to performance degradation in OpenCL for CPUs. Using multiple code examples, from both synthetic and real-life benchmarks, we quantify the impact of these traps, showing how avoiding them can give up to 10 times better performance. Furthermore, we point out that the solutions we provide for avoiding these traps are simple and generic code transformations, which can be easily adopted by either programmers or automated tools. Therefore, we conclude that a certain degree of OpenCL inter-platform performance portability, while indeed not a given, can be achieved by simple and generic code transformations.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"35 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":"125348325","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}
引用次数: 42
A Cooperative Approach for Distributed Task Execution in Autonomic Clouds 自主云中分布式任务执行的协作方法
M. Amoretti, Alberto Lluch-Lafuente, Stefano Sebastio
{"title":"A Cooperative Approach for Distributed Task Execution in Autonomic Clouds","authors":"M. Amoretti, Alberto Lluch-Lafuente, Stefano Sebastio","doi":"10.1109/PDP.2013.47","DOIUrl":"https://doi.org/10.1109/PDP.2013.47","url":null,"abstract":"Virtualization and distributed computing are two key pillars that guarantee scalability of applications deployed in the Cloud. In Autonomous Cooperative Cloud-based Platforms, autonomous computing nodes cooperate to offer a PaaS Cloud for the deployment of user applications. Each node must allocate the necessary resources for applications to be executed with certain QoS guarantees. If the QoS of an application cannot be guaranteed a node has mainly two options: to allocate more resources (if it is possible) or to rely on the collaboration of other nodes. Making a decision is not trivial since it involves many factors (e.g. the cost of setting up virtual machines, migrating applications, discovering collaborators). In this paper we present a model of such scenarios and experimental results validating the convenience of cooperative strategies over selfish ones, where nodes do not help each other. We describe the architecture of the platform of autonomous clouds and the main features of the model, which has been implemented and evaluated in the DEUS discrete-event simulator. From the experimental evaluation, based on workload data from the Google Cloud Backend, we can conclude that (modulo our assumptions and simplifications) the performance of a volunteer cloud can be compared to that of a Google Cluster.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"64 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":"125897362","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}
引用次数: 17
Asynchronous Work Stealing on Distributed Memory Systems 分布式内存系统的异步工作窃取
Shigang Li, Jingyuan Hu, Xin Cheng, Chongchong Zhao
{"title":"Asynchronous Work Stealing on Distributed Memory Systems","authors":"Shigang Li, Jingyuan Hu, Xin Cheng, Chongchong Zhao","doi":"10.1109/PDP.2013.35","DOIUrl":"https://doi.org/10.1109/PDP.2013.35","url":null,"abstract":"Work stealing is a popular policy for dynamic load balancing of irregular applications. However, communication overhead incurred by work stealing may make it less efficient, especially on distributed memory systems. In this work we propose an asynchronous work stealing (AsynchWS) strategy which exploits opportunities to overlap communication with local residual tasks. Profiling information is collected locally to optimize task granularity and guide the asynchronous work stealing. AsynchWS is implemented in Unified Parallel C (UPC), which effectively supports non-blocking one-sided communication and facilitates the implementation. Experiments are conducted on a 32 nodes Xeon X5650 cluster using a set of irregular applications. Results show that up to 16% better performance than the state-of-the-art strategies on distributed memory.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"48 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":"132970288","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}
引用次数: 13
Merging Results from Overlapping Databases in Distributed Information Retrieval 分布式信息检索中重叠数据库结果合并
Shengli Wu, Jieyu Li
{"title":"Merging Results from Overlapping Databases in Distributed Information Retrieval","authors":"Shengli Wu, Jieyu Li","doi":"10.1109/PDP.2013.22","DOIUrl":"https://doi.org/10.1109/PDP.2013.22","url":null,"abstract":"In this paper, we investigate the problem of results merging in distributed information retrieval when overlapping databases are used. We focus on two issues: score normalization and weights assignment for each of the component results. Empirical study with the TREC data has the following three findings: 1. The cubic regression model and logistic regression model are better than the commonly used zero-one score normalization method, 2. The weighting scheme of uneven similarity is an effective method of weights assignment. 3. Score normalization and weights assignment can be used separately or together in a results merging method to improve effectiveness. The findings obtained in this paper are very useful for effectiveness improvement when implementing a distributed information retrieval system.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"84 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113932861","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
Secure Abstraction with Code Capabilities 具有代码功能的安全抽象
R. V. Renesse, H. Johansen, Nihar Naigaonkar, D. Johansen
{"title":"Secure Abstraction with Code Capabilities","authors":"R. V. Renesse, H. Johansen, Nihar Naigaonkar, D. Johansen","doi":"10.1109/PDP.2013.87","DOIUrl":"https://doi.org/10.1109/PDP.2013.87","url":null,"abstract":"We propose embedding executable code fragments in cryptographically protected capabilities to enable flexible discretionary access control in cloud-like computing infrastructures. We demonstrate how such a code capability mechanism can be implemented completely in user space. Using a novel combination of X.509 certificates and JavaScript code, code capabilities support restricted delegation, confinement, revocation, and rights amplification for secure abstraction.","PeriodicalId":202977,"journal":{"name":"2013 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129022797","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}
引用次数: 17
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学术官方微信