2014 IEEE International Parallel & Distributed Processing Symposium Workshops最新文献_第7页

Message from the HCW General Chair 人权公约总主席致辞

2014 IEEE International Parallel & Distributed Processing Symposium Workshops Pub Date : 2014-05-19 DOI: 10.1109/IPDPSW.2014.205

U. Schwiegelshohn

{"title":"Message from the HCW General Chair","authors":"U. Schwiegelshohn","doi":"10.1109/IPDPSW.2014.205","DOIUrl":"https://doi.org/10.1109/IPDPSW.2014.205","url":null,"abstract":"In these proceedings you find the papers corresponding to the presentations during the 23 International Heterogeneity in Computing Workshop (HCW 2014) held on May 19 in Phoenix, Arizona. Recent technological progress has generated various alternatives for the design and use of computer systems. While previous decades have seen the end of the many interesting computer architectures resulting in a reduction of heterogeneity, we experience now an increase in variety and heterogeneity on all levels of a computer system. We observe that heterogeneity has become an important feature in modern computer systems providing many opportunities to increase system performance. But the exploitation of these opportunities is really challenging and requires significant research efforts. Therefore, the topic of the 23 International Heterogeneity in Computing Workshop is at least as current as it was more than twenty years ago. In addition to designing applications that can use existing heterogeneity, we are also facing a more difficult challenge in resource management compared to handling homogeneous systems. Finally, we must reliably determine the performance of components and subsystems in such heterogeneous systems. As these issues are all present in the program of this workshop, I am sure that the papers in these proceedings will provide new and interesting information as well as stimulate new research.","PeriodicalId":153864,"journal":{"name":"2014 IEEE International Parallel & Distributed Processing Symposium Workshops","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127003062","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

Using Physical Stigmergy in Decentralized Optimization under Multiple Non-separable Constraints: Formal Methods and an Intelligent Lighting Example 物理污名在多重不可分约束下的分散优化中的应用:形式化方法和智能照明实例

2014 IEEE International Parallel & Distributed Processing Symposium Workshops Pub Date : 2014-05-19 DOI: 10.1109/IPDPSW.2014.52

Theodore P. Pavlic

{"title":"Using Physical Stigmergy in Decentralized Optimization under Multiple Non-separable Constraints: Formal Methods and an Intelligent Lighting Example","authors":"Theodore P. Pavlic","doi":"10.1109/IPDPSW.2014.52","DOIUrl":"https://doi.org/10.1109/IPDPSW.2014.52","url":null,"abstract":"In this paper, a distributed asynchronous algorithm for intelligent lighting is presented that minimizes collective power use while meeting multiple user lighting constraints simultaneously and requires very little communication among agents participating in the distributed computation. Consequently, the approach is arbitrarily scalable, adapts to exogenous disturbances, and is robust to failures of individual agents. This algorithm is an example of a decentralized primal-space algorithm for constrained non-linear optimization that achieves coordination between agents using stigmergic memory cues present in the physical system as opposed to explicit communication and synchronization. Not only does this work make of stigmergy, a property first used to describe decentralized decision making in eusocial insects, but details of the algorithm are inspired by classic social foraging theory and more recent results in eusocial-insect macronutrient regulation. This theoretical analysis in this paper guarantees that the decentralized stigmergically coupled system converges to within a finite neighborhood of the optimal resource allocation. These results are validated using a hardware implementation of the algorithm in a small-scale intelligent lighting scenario. There are other real-time distributed resource allocation applications that are amenable to these methods, like distributed power generation, in general, this paper means to provide proof of concept that physical variables in cyberphysical systems can be leveraged to reduce the communication burden of algorithms.","PeriodicalId":153864,"journal":{"name":"2014 IEEE International Parallel & Distributed Processing Symposium Workshops","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127788638","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

A Task Scheduling Algorithm Based on Replication for Maximizing Reliability on Heterogeneous Computing Systems 基于复制的异构计算系统最大可靠性任务调度算法

2014 IEEE International Parallel & Distributed Processing Symposium Workshops Pub Date : 2014-05-19 DOI: 10.1109/IPDPSW.2014.175

Shuli Wang, Kenli Li, Jing Mei, Kuan-Ching Li, Yan Wang

引用次数: 2

Analyzing Reliability of Virtual Machine Instances with Dynamic Pricing in the Public Cloud 公共云中动态定价的虚拟机实例可靠性分析

2014 IEEE International Parallel & Distributed Processing Symposium Workshops Pub Date : 2014-05-19 DOI: 10.1109/IPDPSW.2014.101

Seung-Hwan Lim, Gautam Thakur, James L. Horey

{"title":"Analyzing Reliability of Virtual Machine Instances with Dynamic Pricing in the Public Cloud","authors":"Seung-Hwan Lim, Gautam Thakur, James L. Horey","doi":"10.1109/IPDPSW.2014.101","DOIUrl":"https://doi.org/10.1109/IPDPSW.2014.101","url":null,"abstract":"This study presents reliability analysis of virtual machine instances in public cloud environments in the face of dynamic pricing. Different from traditional fixed pricing, dynamic pricing allows price to dynamically fluctuate over arbitrary period of time according to external factors such as supply and demand, excess capacity, etc. This pricing option introduces a new type of fault: virtual machine instances may be unexpectedly terminated due to conflicts in the original bid price and the current offered price. This new class of fault under dynamic pricing may be more dominant than traditional faults in cloud computing environments, where resource availability associated with traditional faults is often above 99.9%. To address and understand this new type of fault, we translated two classic reliability metrics, mean time between failures and availability, to the Amazon Web Services spot market using historical price data. We also validated our findings by submitting actual bids in the spot market. We found that overall, our historical analysis and experimental validation lined up well. Based upon these experimental results, we also provided suggestions and techniques to maximize overall reliability of virtual machine instances under dynamic pricing.","PeriodicalId":153864,"journal":{"name":"2014 IEEE International Parallel & Distributed Processing Symposium Workshops","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122523054","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

Transparent GPU Execution of NumPy Applications 透明GPU执行NumPy应用程序

2014 IEEE International Parallel & Distributed Processing Symposium Workshops Pub Date : 2014-05-19 DOI: 10.1109/IPDPSW.2014.114

Troels Blum, M. R. B. Kristensen, B. Vinter

引用次数: 8

Bohrium: A Virtual Machine Approach to Portable Parallelism Bohrium:一种可移植并行的虚拟机方法

2014 IEEE International Parallel & Distributed Processing Symposium Workshops Pub Date : 2014-05-19 DOI: 10.1109/IPDPSW.2014.44

M. R. B. Kristensen, S. Lund, Troels Blum, K. Skovhede, B. Vinter

引用次数: 17

SupMR: Circumventing Disk and Memory Bandwidth Bottlenecks for Scale-up MapReduce SupMR:规避Scale-up MapReduce的磁盘和内存带宽瓶颈

2014 IEEE International Parallel & Distributed Processing Symposium Workshops Pub Date : 2014-05-19 DOI: 10.1109/IPDPSW.2014.168

Michael Sevilla, I. Nassi, Kleoni Ioannidou, S. Brandt, C. Maltzahn

引用次数: 5

SmartBricks: A Visual Environment to Design and Explore Novel Custom Domain-Specific Architectures SmartBricks:一个设计和探索新的定制领域特定架构的视觉环境

2014 IEEE International Parallel & Distributed Processing Symposium Workshops Pub Date : 2014-05-19 DOI: 10.1109/IPDPSW.2014.22

Anil Kumar Sistla, Xiaozhong Luo, Mukund Malladi, M. Reisner, Rajasekhar Ganduri, Gayatri Mehta

引用次数: 2

MTAAP Introduction and Committees MTAAP简介和委员会

2014 IEEE International Parallel & Distributed Processing Symposium Workshops Pub Date : 2014-05-19 DOI: 10.1109/IPDPSW.2014.225

L. DeRose

引用次数: 0

WECPAR: List Ranking Algorithm and Relative Computational Power WECPAR:列表排序算法和相对计算能力

2014 IEEE International Parallel & Distributed Processing Symposium Workshops Pub Date : 2014-05-19 DOI: 10.1109/IPDPSW.2014.78

H. M. El-Boghdadi

{"title":"WECPAR: List Ranking Algorithm and Relative Computational Power","authors":"H. M. El-Boghdadi","doi":"10.1109/IPDPSW.2014.78","DOIUrl":"https://doi.org/10.1109/IPDPSW.2014.78","url":null,"abstract":"Reconfigurable models were shown to be very powerful in solving many problems faster than non reconfigurable models. WECPAR W(M,N,k) is an M × N reconfigurable model that has point-to-point reconfigurable interconnection with k wires between neighboring processors. This paper studies several aspects of WECPAR. We first solve the list ranking problem on WECPAR. Some of the results obtained show that ranking one element in a list of N elements can be solved on W(N,N,N) WECPAR in O(1) time. Also, on W(N,N,k), ranking a list L(N) of N elements can be done in O((log N)([logk+1])) time. To transfer a large body of algorithms to work on WECPAR and to assess its relative computational power, several simulations algorithms are introduced between WECPAR and well-known models such as PRAM and RMBM. Simulations algorithms show that a PRIORITY CRCW PRAM of N processors and S shared memory locations can be simulated by an W(S, N, k) WECPAR in O([logk+1 N]+[log Sk+1]) time. Also, we show that a PRIORITY CRCW Basic-RMBM(P,B), of P processors and B buses can be simulated by an W(B, P+B, k) WECPAR in O([logk+1 (P+B)]) time. This has the effect of migrating a large number of algorithms to work directly on WECPAR with the simulation overhead.","PeriodicalId":153864,"journal":{"name":"2014 IEEE International Parallel & Distributed Processing Symposium Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125001533","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