The following content has been identified by the YouTube community as being potentially offensive or inappropriate. Viewer discretion is advised.
Please confirm that you wish to view this video.
This video or group may contain content that is inappropriate for some users, as flagged by YouTube's user community.
Please confirm that you wish to view this video.
An experienced police officer tells you why you should never agree to be...
more
An experienced police officer tells you why you should never agree to be interviewed by the police.
less
Mr. James Duane, a professor at Regent Law School and a former defense a...
more
Mr. James Duane, a professor at Regent Law School and a former defense attorney, tells you why you should never agree to be interviewed by the police.
less
Presented by Dr. Andy Yoo, Lawr...
more
Google Tech Talk February 11, 2010
ABSTRACT
Presented by Dr. Andy Yoo, Lawrence Livermore National Laboratory.
Graphs have gained a lot of attention in recent years and have been a focal point in many emerging disciplines such as web mining, computational biology, social network analysis, and national security, just to name a few. These so-called scale-free graphs in the real world have very complex structure and their sizes already have reached unprecedented scale. Furthermore, most of the popular graph algorithms are computationally very expensive, making scalable graph analysis even more challenging. To scale these graph algorithms, which have different run-time characteristics and resource requirements than traditional scientific and engineering applications, we may have to adopt vastly different computing techniques than the current state-of-art. In this talk, I will discuss some of the findings from our studies on the performance and scalability of graph algorithms on various computing environments at LLNL, hoping to shed some light on the challenges in scaling large graph algorithms.
Andy Yoo is a computer scientist in the Center for Applied Scientific Computing (CASC). His current research interests are scalable graph algorithms, high performance computing, large-scale data management, and performance evaluation. He has worked on the large graph problems since 2004. In 2005, he developed a scalable graph search algorithm and demonstrated it by searching a graph with billions of edges on IBM BlueGene/L, then the largest and fastest supercomputer. Andy was nominated for 2005 Gordon Bell award for this work. He is currently working on finding right combination of architecture, systems, and programming model to run large graph algorithms.
Andy earned his Ph.D. degree in Computer Science and Engineering from the Pennsylvania State University in 1998. He joined LLNL in 1998. Andy is a member of the ACM, IEEE and the IEEE Computer Society, and SIAM.
less
From the benefit compilation, "Download to Donate for Haiti," pre...
more
From the benefit compilation, "Download to Donate for Haiti," presented by Music for Relief. Go to MusicForRelief.org to download the album, featuring exclusive tracks from Linkin Park, Dave Matthews Band, Weezer, Jack Johnson, Alanis Morissette, Slash, The All-American Rejects, Hoobastank, The Crystal Method, Kenna, Enrique Iglesias and Lupe Fiasco. 100% of funds received will support those affected by the tragic earthquake in Haiti. Video is produced by Igor Kovalik, directed by Bill Boyd. Footage courtesy of UN Visual Library, Department of Public Information and Ricky Martin Foundation.
less
Entry into the 2010 Linux Commercial Contest - We're Linux in space = 3D animation video intro cover of Universal Studios Intro. This is my parody of Star Trek The Next Generation Sci Fi introduction of the show and for the Borg. I call it: Universal Sci Fi Introductions. It was created in Blender with the use of some public domain .blend files widely available for free download on the Internet & Audacity for the audio effects and recording of my voice. Original video production by the OSGUI Tech Show.
less
