| Document Date: 2012-07-22 21:44:17
Open Document File Size: 220,28 KBShare Result on Facebook
City L. A. / Huberman / Seoul / New York / Adamic / / Company LiveJournal / Amazon / X. Group / Kendall / Google / / Country United States / / Currency USD / / / Facility University Jinyang Li / Building Fast / University of California / / IndustryTerm distributed data-flow computing / sparse asynchronous applications / problem solution / large social networks / cloud computing services / synchronous solution / simplified data processing / past processing / Recent distributed systems / asynchronous solutions / data mining / asynchronous applications / parallel processing / distributed data-parallel computing / web graph / computing / failure-prone hardware / computer communications / distributed web crawler stores / asynchronous solution / distributed web crawling / snapshot algorithm / computation systems / / OperatingSystem Microsoft Windows / / Organization New York University / National Science Foundation / pp. / University of California / Berkeley / USENIX Association / EECS Department / / Person Christopher Mitchell Russell Power / / Position author / application writer / execution and convergence Each worker / Dean / / Product Franklin / Percolator system / Percolator / / ProgrammingLanguage Datalog / Python / C++ / / ProvinceOrState California / / PublishedMedium Machine Learning / / Technology RAM / ChandyLamport snapshot algorithm / API / data mining / Machine Learning / viral marketing / sequential consistency / Operating Systems / Incremental PageRank Computation The PageRank algorithm / parallel processing / network protocols / on providing sequential consistency / /
SocialTag |
Oolong: Asynchronous Distributed Applications Made Easy ∗ Christopher Mitchell Russell Power New York University