A framework for solving sequence problem of multiple input streams

DOI10.1142/S0129054107005121MaRDI QIDQ3065616zbMATH OpenFDO

Authors Cho-Chin Lin

Publication date 6 January 2011

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph modelincremental computingnetwork computingmultiple input streamssequence problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Computing parameters of sequence-based dynamic graphs
• Sequence submodular maximization meets streaming
• Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences
• A generic framework for computing parameters of sequence-based dynamic graphs
• Sequence submodular maximization meets streaming

Cites work

• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences
• Broadcast scheduling optimization for heterogeneous cluster systems
• Efficient collective communication in distributed heterogeneous systems.
• Introduction to algorithms
• Load-skewing task assignment to minimize communication conflicts on network of workstations
• New strategies for assigning real-time tasks to multiprocessor systems

This page was built for publication: A framework for solving sequence problem of multiple input streams

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