Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences

DOI10.1016/J.IPL.2006.11.001zbMATH Open1184.68664OpenAlexW1999465806MaRDI QIDQ845959FDOQ845959

Authors: Cho-Chin Lin, Hao-Yun Yin 

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.001

Recommendations

• Complexity models for incremental computation
• Bounded incremental computation
• Computing with time-varying data: Sequential complexity and parallel speed-up
• scientific article; zbMATH DE number 512869
• An inherent bottleneck in distributed counting

zbMATH Keywords

analysis of algorithmsboundcomputation sequenceincremental computing

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cites Work

• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Communication patterns in distributed computations
• Title not available (Why is that?)

Cited In (1)

• A framework for solving sequence problem of multiple input streams

This page was built for publication: Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845959)