NDLI: Fractional greedy and partial restreaming partitioning: New methods for massive graph partitioning

Content Provider	IEEE Xplore Digital Library
Author	Echbarthi, G. Kheddouci, H.
Copyright Year	2014
Description	Author affiliation: Univ. Lyon1, Lyon, France (Echbarthi, G.; Kheddouci, H.)
Abstract	Graph partitioning is an important challenging problem when performing computation tasks over large distributed graphs; the reason is that a good partitioning leads to faster computations. In this work, we first introduce a new heuristic for streaming partitioning and show that it outperforms the state-of-the-art heuristics for streaming partitioning, leading to exact balance and lower cut. Secondly, we introduce the partial restreaming partitioning which is a hybrid streaming model allowing only several portions of the graph to be restreamed while the rest is to be partitioned on a single pass of the data stream. We show that our method yields partitions of similar quality than those provided by methods restreaming the whole graph (e.g ReLDG, ReFENNEL), while incurring lower cost in running time and memory since only several portions of the graph will be restreamed.
Starting Page	25
Ending Page	32
File Size	1251155
Page Count	8
File Format	PDF
ISBN	9781479956661
DOI	10.1109/BigData.2014.7004368
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-10-27
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Adaptation models Runtime NP-hard problem Linear programming Silicon Partitioning algorithms Load modeling
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fractional greedy and partial restreaming partitioning: New methods for massive graph partitioning.

Fractional greedy and partial restreaming partitioning: New methods for massive graph partitioning.

A physical particle and plane framework for load balancing in multiprocessors

Partial Restreaming Approach for Massive Graph Partitioning.

Semidefinite programming and graph partitioning with preferences.

Partial Restreaming Approach for Massive Graph Partitioning.

EasyHPS: A Multilevel Hybrid Parallel System for Dynamic Programming

Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs

Scalable libraries for graph partitioning

Fractional greedy and partial restreaming partitioning: New methods for massive graph partitioning

Similar Documents

Fractional greedy and partial restreaming partitioning: New methods for massive graph partitioning.

Fractional greedy and partial restreaming partitioning: New methods for massive graph partitioning.

A physical particle and plane framework for load balancing in multiprocessors

Partial Restreaming Approach for Massive Graph Partitioning.

Semidefinite programming and graph partitioning with preferences.

Partial Restreaming Approach for Massive Graph Partitioning.

EasyHPS: A Multilevel Hybrid Parallel System for Dynamic Programming

Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs

Scalable libraries for graph partitioning

Fractional greedy and partial restreaming partitioning: New methods for massive graph partitioning