Efficient partitioning of sequences

DOI10.1109/12.475128zbMath1068.68628OpenAlexW1976207821MaRDI QIDQ4421153

Fredrik Manne, Bjørn Olstad

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

Mathematics Subject Classification ID

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

Related Items

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