Show simple item record

dc.contributor.authorChuprikov, Pavel 
dc.contributor.authorDavydow, Alex
dc.contributor.authorKogan, Kirill 
dc.contributor.authorNikolenko, Sergey
dc.contributor.authorSirotkin, Alexander V.
dc.date.accessioned2021-07-13T09:34:10Z
dc.date.available2021-07-13T09:34:10Z
dc.date.issued2018-06-18
dc.identifier.urihttp://hdl.handle.net/20.500.12761/575
dc.description.abstractEfficient 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.isoeng
dc.titleFormalizing Compute-Aggregate Problems in Cloud Computingen
dc.typeconference object
dc.conference.date18-21 June 2018
dc.conference.placeMa'ale HaHamisha, Israel
dc.conference.titleThe 25th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2018)*
dc.event.typeconference
dc.pres.typepaper
dc.type.hasVersionVoR
dc.rights.accessRightsopen access
dc.page.final19
dc.page.initial1
dc.description.refereedTRUE
dc.description.statuspub
dc.eprint.idhttp://eprints.networks.imdea.org/id/eprint/1821


Files in this item

This item appears in the following Collection(s)

Show simple item record