Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures最新文献

Cloud scheduling with setup cost 具有设置成本的云调度

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures Pub Date : 2013-07-23 DOI: 10.1145/2486159.2486195

Y. Azar, Naama Ben-Aroya, Nikhil R. Devanur, Navendu Jain

引用次数: 26

Session details: Session 5 会话详情:会话5

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures Pub Date : 2013-07-23 DOI: 10.1145/3250642

M. Snir

引用次数: 0

Session details: Session 3: brief announcements 会议详情:第3部分:简短公告

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures Pub Date : 2013-07-23 DOI: 10.1145/3250640

C. Leiserson

引用次数: 0

Towards a fully-articulated pessimistic distributed transactional memory 走向一个完全铰接的悲观分布式事务性内存

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures Pub Date : 2013-07-23 DOI: 10.1145/2486159.2486166

Konrad Siek, P. Wojciechowski

引用次数: 11

Locality in wireless scheduling 无线调度中的局部性

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures Pub Date : 2013-07-23 DOI: 10.1145/2486159.2486167

M. Halldórsson

{"title":"Locality in wireless scheduling","authors":"M. Halldórsson","doi":"10.1145/2486159.2486167","DOIUrl":"https://doi.org/10.1145/2486159.2486167","url":null,"abstract":"Locality is one of the fundamental issues in computing, with particular resonance in distributed settings. When it comes to wireless communication, it is not only an issue of what can be computed by consulting with your neighbors, but whether what happens far away can adversely affect whether you can actually do your work. With increasing attention to fading models of interference, such as the SINR model, lack of locality in communication has risen to the fore. When models take into account and accumulate arbitrarily far away transmissions, everyone seems to be affected by everyone else. This apparently unavoidable non-locality effect has been frequently cited as an impediment to effective analysis of SINR algorithms, especially distributed (see, e.g., [5, 1, 3]). Our main result is that a useful form of locality can actually be achieved in the SINR model. Specifically, we define locality to mean that the combined interference of any reasonably sparse (say, feasible) instance on any link that is “well-separated” from the instance must be low. It turns out that this locality property depends directly on the power assignment used: locality holds if power increases strictly faster than the square of the intended transmission distance (but not beyond the socalled path-loss factor), and fails otherwise.","PeriodicalId":353007,"journal":{"name":"Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129338602","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

Drop the anchor: lightweight memory management for non-blocking data structures 放下锚:用于非阻塞数据结构的轻量级内存管理

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures Pub Date : 2013-07-23 DOI: 10.1145/2486159.2486184

Anastasia Braginsky, Alex Kogan, E. Petrank

引用次数: 50

Session details: Session 6 会话详情:会话6

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures Pub Date : 2013-07-23 DOI: 10.1145/3250643

C. Scheideler

引用次数: 0

Nonclairvoyant sleep management and flow-time scheduling on multiple processors 非千里眼睡眠管理和多处理器流时间调度

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures Pub Date : 2013-07-23 DOI: 10.1145/2486159.2486179

Sze-Hang Chan, T. Lam, Lap-Kei Lee, Jianqiao Zhu

{"title":"Nonclairvoyant sleep management and flow-time scheduling on multiple processors","authors":"Sze-Hang Chan, T. Lam, Lap-Kei Lee, Jianqiao Zhu","doi":"10.1145/2486159.2486179","DOIUrl":"https://doi.org/10.1145/2486159.2486179","url":null,"abstract":"In large data centers, managing the availability of servers is often non-trivial, especially when the workload is unpredictable. Using too many servers would waste energy, while using too few would affect the performance. A recent theoretical study, which assumes the clairvoyant model where job size is known at arrival time, has successfully integrated sleep-and-wakeup management into multi-processor job scheduling and obtained a competitive tradeoff between flow time and energy [6]. This paper extends the study to the nonclairvoyant model where the size of a job is not known until the job is finished. We give a new online algorithm SATA which is, for any ε > 0, (1 + ε)-speed O( 1⁄ε2 )-competitive for the objective of minimizing the sum of flow time and energy. SATA also gives a new nonclairvoyant result for the classic setting where all processors are always on and the concern is flow time only. In this case, the previous work of Chekuri et al. [7] and Chadha et al. [8] has revealed that random dispatching can give a non-migratory algorithm that is (1 + ε)-speed O( 1⁄ε3 )-competitive, and any deterministic non-migratory algorithm is Ω(m⁄s)-competitive using s-speed processors [7], where m is the number of processors. SATA, which is a deterministic algorithm migrating each job at most four times on average, has a competitive ratio of O(1⁄ε2). The number of migrations used by SATA is optimal up to a constant factor as we can extend the above lower bound result.","PeriodicalId":353007,"journal":{"name":"Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129132905","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

Work-efficient matrix inversion in polylogarithmic time 在多对数时间内的高效矩阵反演

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures Pub Date : 2013-07-23 DOI: 10.1145/2486159.2486173

P. Sanders, Jochen Speck, Raoul Steffen

引用次数: 6

Coalescing-branching random walks on graphs 图上的聚并分支随机漫步

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures Pub Date : 2013-07-23 DOI: 10.1145/2486159.2486197

Chinmoy Dutta, Gopal Pandurangan, R. Rajaraman, Scott T. Roche

{"title":"Coalescing-branching random walks on graphs","authors":"Chinmoy Dutta, Gopal Pandurangan, R. Rajaraman, Scott T. Roche","doi":"10.1145/2486159.2486197","DOIUrl":"https://doi.org/10.1145/2486159.2486197","url":null,"abstract":"We study a distributed randomized information propagation mechanism in networks we call the coalescing-branching random walk (cobra walk, for short). A cobra walk is a generalization of the well-studied \"standard\" random walk, and is useful in modeling and understanding the Susceptible-Infected Susceptible (SIS)-type of epidemic processes in networks. It can also be helpful in performing light-weight information dissemination in resource-constrained networks. A cobra walk is parameterized by a branching factor k. The process starts from an arbitrary node, which is labeled active for step 1. (For instance, this could be a node that has a piece of data, rumor, or a virus.) In each step of a cobra walk, each active node chooses k random neighbors to become active for the next step (\"branching\"). A node is active for step t + 1 only if it is chosen by an active node in step t (\"coalescing\"). This results in a stochastic process in the underlying network with properties that are quite different from both the standard random walk (which is equivalent to the cobra walk with branching factor 1) as well as other gossip-based rumor spreading mechanisms. We focus on the cover time of the cobra walk, which is the number of steps for the walk to reach all the nodes, and derive almost-tight bounds for various graph classes. Our main technical result is an O(log2 n) high probability bound for the cover time of cobra walks on expanders, if either the expansion factor or the branching factor is sufficiently large; we also obtain an O(log n) high probability bound for the partial cover time, which is the number of steps needed for the walk to reach at least a constant fraction of the nodes. We show that the cobra walk takes O(n log n) steps on any n-node tree for k ≥ 2, and Õ(n1/d) steps on a d-dimensional grid for k ≥ 2, with high probability.","PeriodicalId":353007,"journal":{"name":"Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115358549","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