Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures最新文献_第6页

Almost Optimal Streaming Algorithms for Coverage Problems 覆盖问题的几乎最优流算法

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2016-10-25 DOI: 10.1145/3087556.3087585

M. Bateni, Hossein Esfandiari, V. Mirrokni

{"title":"Almost Optimal Streaming Algorithms for Coverage Problems","authors":"M. Bateni, Hossein Esfandiari, V. Mirrokni","doi":"10.1145/3087556.3087585","DOIUrl":"https://doi.org/10.1145/3087556.3087585","url":null,"abstract":"Maximum coverage and minimum set cover problems---here collectively called coverage problems---have been studied extensively in streaming models. However, previous research not only achieves suboptimal approximation factors and space complexities but also study a restricted set-arrival model which makes an explicit or implicit assumption on oracle access to the sets, ignoring the complexity of reading and storing the whole set at once. In this paper, we address the above shortcomings and present algorithms with improved approximation factor and improved space complexity, and prove that our results are almost tight. Moreover, unlike most of the previous work, our results hold in a more general edge-arrival model. More specifically, consider an instance with n sets, together covering m elements. Information arrives in the form of \"edges\" from sets to elements (denoting membership) in arbitrary order. We present (almost) optimal approximation algorithms for maximum coverage and minimum set cover problems in the streaming model with an (almost) optimal space complexity of Õ(n); i.e., the space is independent of the size of the sets or the size of the ground set of elements. These results not only improve the best known algorithms for the set-arrival model, but also are the first such algorithms for the more powerful edge-arrival model. In order to achieve the above results, we introduce a new general sketching technique for coverage functions: One can apply this sketching scheme to convert an α-approximation algorithm for a coverage problem to a (1-ε)α-approximation algorithm for the same problem in streaming model. We show the significance of our sketching technique by ruling out the possibility of solving coverage problems via accessing (as a black box) a (1 ± ε)-approximate oracle (e.g., a sketch function) that estimates the coverage function on any subfamily of the sets. Finally, we show that our streaming algorithms achieve an almost optimal space complexity.","PeriodicalId":162994,"journal":{"name":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130358062","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}

引用次数: 40

Distributed Graph Clustering by Load Balancing 基于负载均衡的分布式图聚类

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2016-07-18 DOI: 10.1145/3087556.3087569

He Sun, Luca Zanetti

{"title":"Distributed Graph Clustering by Load Balancing","authors":"He Sun, Luca Zanetti","doi":"10.1145/3087556.3087569","DOIUrl":"https://doi.org/10.1145/3087556.3087569","url":null,"abstract":"Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of algorithmic design methods for graph clustering. However, most of these methods are based on complicated spectral techniques or convex optimisation, and cannot be applied directly for clustering many networks that occur in practice, whose information is often collected on different sites. Designing a simple and distributed clustering algorithm is of great interest, and has wide applications for processing big datasets. In this paper we present a simple and distributed algorithm for graph clustering: for a wide class of graphs that are characterised by a strong cluster-structure, our algorithm finishes in a poly-logarithmic number of rounds, and recovers a partition of the graph close to an optimal partition. The main component of our algorithm is an application of the random matching model of load balancing, which is a fundamental protocol in distributed computing and has been extensively studied in the past 20 years. Hence, our result highlights an intrinsic and interesting connection between graph clustering and load balancing. At a technical level, we present a purely algebraic result characterising the early behaviours of load balancing processes for graphs exhibiting a cluster-structure. We believe that this result can be further applied to analyse other gossip processes, such as rumour spreading and averaging processes.","PeriodicalId":162994,"journal":{"name":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116615500","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

Asymptotically Optimal Approximation Algorithms for Coflow Scheduling Coflow调度的渐近最优逼近算法

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2016-06-20 DOI: 10.1145/3087556.3087567

Hamidreza Jahanjou, Erez Kantor, R. Rajaraman

{"title":"Asymptotically Optimal Approximation Algorithms for Coflow Scheduling","authors":"Hamidreza Jahanjou, Erez Kantor, R. Rajaraman","doi":"10.1145/3087556.3087567","DOIUrl":"https://doi.org/10.1145/3087556.3087567","url":null,"abstract":"Many modern datacenter applications involve large-scale computations composed of multiple data flows that need to be completed over a shared set of distributed resources. Such a computation completes when all of its flows complete. A useful abstraction for modeling such scenarios is a coflow, which is a collection of flows (e.g., tasks, packets, data transmissions) that all share the same performance goal. In this paper, we present the first approximation algorithms for scheduling coflows over general network topologies with the objective of minimizing total weighted completion time. We consider two different models for coflows based on the nature of individual flows: circuits, and packets. We design constant-factor polynomial-time approximation algorithms for scheduling packet-based coflows with or without given flow paths, and circuit-based coflows with given flow paths. Furthermore, we give an O(log n/log log n)-approximation polynomial time algorithm for scheduling circuit-based coflows without given flow paths (here n is the number of network edges). We obtain our results by developing a general framework for coflow schedules, based on interval-indexed linear programs, which may extend to other coflow models and objective functions and may also yield improved approximation bounds for specific network scenarios. We also present an experimental evaluation of our approach for circuit-based coflows that show a performance improvement of at least %22 on average over competing heuristics.","PeriodicalId":162994,"journal":{"name":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127663502","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}

引用次数: 18

A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem 对称特征值问题的避免通信并行算法

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2016-04-13 DOI: 10.1145/3087556.3087561

Edgar Solomonik, Grey Ballard, J. Demmel, T. Hoefler

引用次数: 11

Online Tree Caching 在线树缓存

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2016-02-27 DOI: 10.1145/3087556.3087558

Marcin Bienkowski, Jan Marcinkowski, Maciej Pacut, S. Schmid, Aleksandra Spyra

引用次数: 12