Making large graph algorithms: Evaluation of current state-of-the-art and lessons learned

Making large graph algorithms: Evaluation of current state-of-the-art and lessons learned Tube. Duration : 50.62 Mins.

Google Tech Talk February 11, 2010 ABSTRACT Dr. Andy Yoo, Lawrence Livermore National Laboratory presented. Graphics have gained a lot of attention in recent years and are a central element in many emerging disciplines such as web mining, bioinformatics, network analysis, social and national security, to name a few. These so-called scale-free graphs in the real world have a very complex structure and their size reached unprecedented proportions. In addition, mostpopular graphics algorithms is computationally very expensive, so the scalable graphical analysis more difficult. Thus, these graphics algorithms, the different run-time properties and resource requirements compared to traditional scale scientific and technical applications, information technology, we can assume very different from the current state of the art. In this talk I will discuss some of the results of our studies on the performance and scalability of graph algorithmsLLNL different IT environments in the hope of shedding some 'light on the challenges in scaling algorithms large graphic. Andy Yoo is a computer scientist at the Center for Applied Scientific Computing (CASC). His current research interests include scalable graphics algorithms, high performance computing, large data management and performance evaluation. He has worked on large video problems since 2004. In 2005 he developed a search algorithm scalable graphics and showed it, looking for aGraphics ...

Tags: google, tech, talk, mathematics, web, mining

kluge leather messenger bag catnapper sofa smartparts digital frames