Efficient partitioning of sequences

DOI10.1109/12.475128zbMATH Open1068.68628OpenAlexW1976207821MaRDI QIDQ4421153FDOQ4421153

Authors: Bjørn Olstad, Fredrik Manne 

Publication date: 10 November 2003

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.475128

Recommendations

• Optimal Partitioning of Sequences
• Algorithms for Scheduling Independent Tasks
• Efficient array partitioning
• Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks
• Optimal Set Partitioning

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (13)

• Complexity results for throughput and latency optimization of replicated and data-parallel workflows
• Parallel \(\mathcal H\)-matrix arithmetics on shared memory systems
• Minimum \(L_k\) path partitioning-an illustration of the Monge property
• Mapping pipeline skeletons onto heterogeneous platforms
• One-dimensional partitioning for heterogeneous systems: theory and practice
• Approximations for the general block distribution of a matrix
• Load-balancing spatially located computations using rectangular partitions
• Optimal Partitioning of Sequences
• New challenges in dynamic load balancing
• Queueing and glueing for optimal partitioning (functional pearl)
• Approximations for the general block distribution of a matrix
• A parallel fast boundary element method using cyclic graph decompositions
• Efficient array partitioning

This page was built for publication: Efficient partitioning of sequences

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