dc.contributor.author | Matveev, Alexander | |
dc.contributor.author | Meirovitch, Yaron | |
dc.contributor.author | Saribekyan, Hayk | |
dc.contributor.author | Jakubiuk, Wiktor B. | |
dc.contributor.author | Kaler, Timothy | |
dc.contributor.author | Odor, Gergely | |
dc.contributor.author | Budden, David | |
dc.contributor.author | Zlateski, Aleksandar | |
dc.contributor.author | Shavit, Nir N. | |
dc.date.accessioned | 2018-02-02T17:48:09Z | |
dc.date.available | 2018-02-02T17:48:09Z | |
dc.date.issued | 2017-02 | |
dc.identifier.isbn | 9781450344937 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/113396 | |
dc.description.abstract | The current design trend in large scale machine learning is to use distributed clusters of CPUs and GPUs with MapReduce-style programming. Some have been led to believe that this type of horizontal scaling can reduce or even eliminate the need for traditional algorithm development, careful parallelization, and performance engineering. This paper is a case study showing the contrary: that the benefits of algorithms, parallelization, and performance engineering, can sometimes be so vast that it is possible to solve "cluster-scale" problems on a single commodity multicore machine.
Connectomics is an emerging area of neurobiology that uses cutting edge machine learning and image processing to extract brain connectivity graphs from electron microscopy images. It has long been assumed that the processing of connectomics data will require mass storage, farms of CPU/GPUs, and will take months (if not years) of processing time. We present a high-throughput connectomics-on-demand system that runs on a multicore machine with less than 100 cores and extracts connectomes at the terabyte per hour pace of modern electron microscopes. | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (grant IIS-1447786) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (grant CCF1563880) | en_US |
dc.description.sponsorship | United States. Intelligence Advanced Research Projects Activity (grant 138076-5093555) | en_US |
dc.language.iso | en_US | |
dc.publisher | Association for Computing Machinery (ACM) | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1145/3018743.3018766 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | MIT Web Domain | en_US |
dc.title | A Multicore Path to Connectomics-on-Demand | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Matveev, Alexander, Yaron Meirovitch, Hayk Saribekyan, Wiktor Jakubiuk, Tim Kaler, Gergely Odor, David Budden, Aleksandar Zlateski, and Nir Shavit. “A Multicore Path to Connectomics-on-Demand.” Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP ’17 (2017). | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
dc.contributor.mitauthor | Matveev, Alexander | |
dc.contributor.mitauthor | Meirovitch, Yaron | |
dc.contributor.mitauthor | Saribekyan, Hayk | |
dc.contributor.mitauthor | Jakubiuk, Wiktor B. | |
dc.contributor.mitauthor | Kaler, Timothy | |
dc.contributor.mitauthor | Odor, Gergely | |
dc.contributor.mitauthor | Budden, David | |
dc.contributor.mitauthor | Zlateski, Aleksandar | |
dc.contributor.mitauthor | Shavit, Nir N. | |
dc.relation.journal | Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '17 | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
dspace.orderedauthors | Matveev, Alexander; Meirovitch, Yaron; Saribekyan, Hayk; Jakubiuk, Wiktor; Kaler, Tim; Odor, Gergely; Budden, David; Zlateski, Aleksandar; Shavit, Nir | en_US |
dspace.embargo.terms | N | en_US |
dc.identifier.orcid | https://orcid.org/0000-0003-4235-0036 | |
dc.identifier.orcid | https://orcid.org/0000-0002-1946-8012 | |
dc.identifier.orcid | https://orcid.org/0000-0002-1266-5742 | |
dc.identifier.orcid | https://orcid.org/0000-0002-3831-8255 | |
dc.identifier.orcid | https://orcid.org/0000-0001-5901-7964 | |
dc.identifier.orcid | https://orcid.org/0000-0002-4552-2414 | |
mit.license | OPEN_ACCESS_POLICY | en_US |