Now showing items 1-4 of 4
High performance computing for irregular algorithms and applications with an emphasis on big data analytics
(Georgia Institute of Technology, 2014-03-31)
Irregular algorithms such as graph algorithms, sorting, and sparse matrix multiplication, present numerous programming challenges, including scalability, load balancing, and efficient memory utilization. In this age of Big ...
Algorithms for large graphs
(Georgia Institute of Technology, 2010-07-01)
Graph and geometric algorithms on distributed networks and databases
(Georgia Institute of Technology, 2011-05-16)
In this thesis, we study the power and limit of algorithms on various models, aiming at applications in distributed networks and databases. In distributed networks, graph algorithms are fundamental to many applications. ...
Algorithm design on multicore processors for massive-data analysis
(Georgia Institute of Technology, 2010-06-28)
Analyzing massive-data sets and streams is computationally very challenging. Data sets in systems biology, network analysis and security use network abstraction to construct large-scale graphs. Graph algorithms such as ...