ASMS_CSC Archives

MS Student

ASMS_CSC@LISTSERV.GSU.EDU

Options: Use Forum View

Use Monospaced Font
Show HTML Part by Default
Condense Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Sender:
MS Student <[log in to unmask]>
Date:
Mon, 28 Sep 2015 14:06:04 +0000
Reply-To:
MS Student <[log in to unmask]>
Subject:
From:
Tammie T Dudley <[log in to unmask]>
MIME-Version:
1.0
In-Reply-To:
Content-Type:
multipart/alternative; boundary="_000_SN1PR0501MB17756E05C831322C20CEBA80B04F0SN1PR0501MB1775_"
Comments:
Parts/Attachments:
text/plain (2991 bytes) , text/html (8 kB)
Dear All,
Departmental Colloquium: Dr. Ling Liu
When:
September 28, 2015 @ 1:00 pm - 2:00 pm
Where:
Department Conference Room (25 Park Place, Room 755)
Colloquia<http://cs.gsu.edu/connections/events/cat_ids%7E23/>
Big Graph Processing: Parallel Abstractions and Optimizations

Dr. Ling Liu
<http://www.cc.gatech.edu/home/lingliu/>Professor
Distributed Data Intensive Systems Lab
School of Computer Science
Georgia Institute of Technology

Large-scale real-world graphs are known to have highly skewed vertex degree distribution and highly skewed edge weight distribution. Existing vertex-centric iterative graph computation models suffer from poor scalability due to a number of serious problems: poor load balance of parallel execution, inefficient CPU resource utilization with respect to the cost of in-memory or on-disk graph access, and insufficient optimizations for computational performance. In this talk, I will first discuss the main challenges for big graph processing and then present GraphTwist, a scalable, efficient, and provably correct two-tier graph parallel processing system. At the storage and access tiers, GraphTwist maximizes parallel efficiency by employing three graph parallel abstractions for partitioning a big graph by slice-, strip-, or dice-based partitioning techniques. At the computation tier, GraphTwist presents two utility-aware pruning strategies: slice pruning and cut pruning, to further improve computational performance while preserving the computational utility defined by graph applications. I will end the talk by presenting some interesting research problems and unique opportunities in high-performance large-scale graph processing.

About the Speaker: Dr. Ling Liu is a professor in the School of Computer Science at the Georgia Institute of Technology. She directs the research programs in the Distributed Data Intensive Systems Lab (DiSL), examining various aspects of large-scale data-intensive systems, including performance, availability, security, and privacy. Prof. Liu is an elected IEEE Fellow and a recipient of the IEEE Computer Society Technical Achievement Award in 2012. She has published over 300 international journal and conference articles and is a recipient of the best paper award from a number of top venues, including ICDCS 2003, WWW 2004, 2005 Pat Goldberg Memorial Best Paper Award, IEEE Cloud 2012, IEEE ICWS 2013, Mobiquitous 2014, and ACM/IEEE CCGrid 2015. In addition to serving as general chair and PC chair for numerous IEEE and ACM conferences in the data engineering, very large databases, distributed computing, and cloud computing fields, Prof. Liu has served on the editorial board of over a dozen international journals. Currently, Prof. Liu is the editor-in-chief of IEEE Transactions on Service Computing. Prof. Liu's current research is primarily sponsored by NSF, IBM, and Intel.

===========================



thanks!



best regards,



yanqing


ATOM RSS1 RSS2