2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing最新文献_第9页

Modeling Network-Level Impacts of P2P Flows P2P流的网络级影响建模

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.9

Márk Jelasity, Vilmos Bilicki, Miklos Kasza

{"title":"Modeling Network-Level Impacts of P2P Flows","authors":"Márk Jelasity, Vilmos Bilicki, Miklos Kasza","doi":"10.1109/PDP.2011.9","DOIUrl":"https://doi.org/10.1109/PDP.2011.9","url":null,"abstract":"It has been clear for a long time that P2P applications represent a large proportion of the load on the network infrastructure. This is why significant research efforts have been devoted to reducing this load, in the form of ISP friendly P2P solutions. These solutions focus on the volume of the traffic as opposed to the number of network flows. At the same time, we are witnessing a great demand for more and more intelligence in the network such as flow based monitoring and application recognition, which have an overhead that depends on the number of flows and not on the volume of the traffic. Besides, the implementation of this intelligence is moving from the access layer towards the distribution and core layers. We show through measurements that the typical devices serving in the different layers of the infrastructure are not sufficiently scalable in terms of the number of flows, and, most importantly, the combined effect of an increase in the access layer bandwidth together with an increase in the P2P (e.g., BitTorrent) population will practically disable the intelligent networking capabilities. Our conclusion is that a novel focus needs to be incorporated into P2P research that concentrates on reducing the number of network flows generated by P2P applications.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131292534","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

Transport Optimization in Peer-to-Peer Networks 对等网络中的传输优化

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.26

K. Miller, A. Wolisz

{"title":"Transport Optimization in Peer-to-Peer Networks","authors":"K. Miller, A. Wolisz","doi":"10.1109/PDP.2011.26","DOIUrl":"https://doi.org/10.1109/PDP.2011.26","url":null,"abstract":"The peer-to-peer networking concept has revolutionized the cost structure of Internet data dissemination by making large scale content delivery with low server cost feasible. In a peer-to-peer network, the total upload capacity increases with the number of down loaders instead of staying constant as in a client-server architecture, making it highly scalable. Despite of its importance, the problem of efficient data transport in a peer-to-peer network is still an open issue, mainly due to its complex combinatorial structure. In the presented work, we formulate the problem of optimizing a peer-to-peer download with respect to its make span (time until all peers finish downloading)as a mixed integer linear program. Other than previous studies, we consider the case of arbitrary heterogeneous uplink and downlink capacities of the peers. Moreover, we do not consider the fluid limit case but allow the file to be subdivided in finitely many chunks. On the one hand, our results allow to infer the capacity of a peer-to-peer network, providing a benchmark for performance analysis of existing peer-to-peer protocols. On the other hand, we believe that our results build a step towards the development of efficient algorithms serving as a base for the design of data transport protocols leveraging the peer-to-peer concept.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"337 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115670753","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

Task Migration in Mesh NoCs over Virtual Point-to-Point Connections 虚拟点对点连接上Mesh noc的任务迁移

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.71

B. Goodarzi, H. Sarbazi-Azad

{"title":"Task Migration in Mesh NoCs over Virtual Point-to-Point Connections","authors":"B. Goodarzi, H. Sarbazi-Azad","doi":"10.1109/PDP.2011.71","DOIUrl":"https://doi.org/10.1109/PDP.2011.71","url":null,"abstract":"Processor allocation in todays many core MPSoCs is a challenging task, especially since the order and requirements of incoming applications are unknown during design stage. To improve network performance, balance the workload across processing cores, or mitigate the effect of hot processing elements in thermal management methodologies, task migration is a method which has attracted much attention in recent years. Runtime task migration was first proposed in multicomputer with load balancing as the major objective. However, specific NoC properties such as limited amount of communication buffers, more sensitivity to implementation complexity, and tight latency and power consumption constraints bring new challenges in using task migration mechanisms in NoCs. As a consequence, the efficiency and applicability of traditional migration mechanisms (developed for multicomputers) are under question. Due to the limited resource budget in NoC-based MPSoCs as well as tight performance constraints of running applications, in this paper, we propose an efficient methodology based on virtual point-to-point (VIP for short) connections. These dedicated VIP connections provide low-latency and low-power paths for heavy communication flows created by task migration mechanisms. Analyzing the results show that the proposed scheme reduces message latency by 13% and migration latency by 14%, while 10% power savings can be achieved compared to the previously proposed task migration strategy (known as Gathering-Rout-Scattering) for mesh multiprocessors.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"20 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120874022","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}

引用次数: 23

A Deadline Satisfaction Enhanced Workflow Scheduling Algorithm 一种期限满意度增强的工作流调度算法

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.29

Xi Li, Zhi-gang Hu, Chaokun Yan

{"title":"A Deadline Satisfaction Enhanced Workflow Scheduling Algorithm","authors":"Xi Li, Zhi-gang Hu, Chaokun Yan","doi":"10.1109/PDP.2011.29","DOIUrl":"https://doi.org/10.1109/PDP.2011.29","url":null,"abstract":"Meeting users' deadline constraint is usually the most important goal of workflow scheduling in Grid environment. In order to consider the dynamism of Grid resource, we adopted a stochastic model to describe dynamic workloads of Grid resources. A concept called Deadline Satisfaction Degree of Workflow (DSDW) was defined to represent the probability that a workflow could be completed before its deadline. We calculated task execution priorities based on their precedence relations in the workflow, then determined the candidate resource for each task so as to maximize DSDW, finally converted distribution problem of overall workflow deadline into a nonlinear programming problem with constraints and resolved it with known solutions. A Deadline Satisfaction Enhanced Scheduling Algorithm for Workflow (DSESAW) involving deadline distribution and resource selection was presented. The extensive simulation experiments using a practical medical image analysis application was conducted to verify our algorithm. Experimental results indicated that our algorithm could adapt to dynamic Grid environment and provide a good guarantee for user's deadline requirements.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124321820","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

Multi-core Desktop Processors Make Possible Real-Time Electron Tomography 多核桌面处理器使实时电子断层扫描成为可能

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.36

Jose Ignacio Agulleiro Baldo, E. M. Garzón, I. García, José-Jesús Fernández

引用次数: 0

A Javaspace-Based Framework for Efficient Fault-Tolerant Master-Worker Distributed Applications 基于javascript的高效容错主worker分布式应用框架

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.82

V. Galtier, C. Makassikis, S. Vialle

引用次数: 3

On Designing Multicore-Aware Simulators for Biological Systems 生物系统多核感知模拟器设计研究

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2010-10-12 DOI: 10.1109/PDP.2011.81

Marco Aldinucci, M. Coppo, Ferruccio Damiani, M. Drocco, M. Torquati, Angelo Troina

引用次数: 18

Accelerating Parameter Sweep Applications Using CUDA 使用CUDA加速参数扫描应用程序

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2009-06-05 DOI: 10.1109/PDP.2011.19

M. Motokubota, Fumihiko Ino, K. Hagihara

引用次数: 3