Formalizing Compute-Aggregate Problems in Cloud Computing
dc.contributor.author | Chuprikov, Pavel | |
dc.contributor.author | Davydow, Alex | |
dc.contributor.author | Kogan, Kirill | |
dc.contributor.author | Nikolenko, Sergey | |
dc.contributor.author | Sirotkin, Alexander V. | |
dc.date.accessioned | 2021-07-13T09:34:10Z | |
dc.date.available | 2021-07-13T09:34:10Z | |
dc.date.issued | 2018-06-18 | |
dc.identifier.uri | http://hdl.handle.net/20.500.12761/575 | |
dc.description.abstract | Efficient representation of data aggregations is a fundamental problem in modern big data applications, where network topologies and deployed routing and transport mechanisms play a fundamental role to optimize desired objectives: cost, latency, and others. We study the design principles of routing and transport infrastructure and identify extra information that can be used to improve implementations of computeaggregate tasks. We build a taxonomy of compute-aggregate services unifying aggregation design principles, propose algorithms for each class, analyze them, and support our results with an extensive experimental study. | |
dc.language.iso | eng | |
dc.title | Formalizing Compute-Aggregate Problems in Cloud Computing | en |
dc.type | conference object | |
dc.conference.date | 18-21 June 2018 | |
dc.conference.place | Ma'ale HaHamisha, Israel | |
dc.conference.title | The 25th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2018) | * |
dc.event.type | conference | |
dc.pres.type | paper | |
dc.type.hasVersion | VoR | |
dc.rights.accessRights | open access | |
dc.page.final | 19 | |
dc.page.initial | 1 | |
dc.description.refereed | TRUE | |
dc.description.status | pub | |
dc.eprint.id | http://eprints.networks.imdea.org/id/eprint/1821 |