با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
دسته بندی:
داده های بزرگ - big data
سال انتشار:
2018
عنوان انگلیسی مقاله:
Partitioning big graph with respect to arbitrary proportions in a streaming manner
ترجمه فارسی عنوان مقاله:
تقسیم بندی نمودار بزرگ با توجه به نسبت های دلخواه به شیوه جریان
منبع:
Sciencedirect - Elsevier - Future Generation Computer Systems, 80 (2018) 1-11: doi:10:1016/j:future:2017:06:027
نویسنده:
Ke-kun Hu, Guo-sun Zeng *, Huo-wen Jiang, Wei Wang
چکیده انگلیسی:
Using a single commodity computational node to partition big graph is very difficult. This work studies
how to partition a big graph with respect to arbitrary proportions in a streaming manner. To meet diverse
requirements of big graph partitioning scenarios, we first devise 3 measurement schemes for measuring
the graph vertex count, graph workload, and graph processing time, respectively. These schemes are
the bases and prerequisites for big graph partitioning. Due to the difficulty in acquiring full big graph
information, we then design 8 streaming heuristics to partitioning a big graph during the process of
loading its data from external disks into memory. Each of these heuristics decides where to assign every
vertex in the stream based on the information calculated by one of the above 3 schemes. At last, we
demonstrate the performance and flexibility of our heuristics in partitioning real and synthetic graph
datasets on a medium-sized cluster. The characteristics of arbitrary proportions of our approach makes it
have a wide range of applications.
Keywords: Graph partitioning ، Arbitrary proportions ، Measurement scheme ، Streaming heuristic ، Metric
قیمت: رایگان
توضیحات اضافی:
تعداد نظرات : 0