Efficient out-of-core algorithms for linear relaxation using blocking covers

DOI10.1006/jcss.1997.1473zbMath0877.68063OpenAlexW4249066449MaRDI QIDQ1356889

O. Diekmann

Publication date: 8 December 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/234b637117e71e31f4980fde8e14033614641df2

zbMATH Keywords

out-of-coreblocking covers

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (5)

Efficient out-of-core algorithms for linear relaxation using blocking covers ⋮ Combinatorial aspects of geometric graphs ⋮ CACHE MISS ANALYSIS OF 2D STENCIL CODES WITH TILED TIME LOOP ⋮ Efficient automatic simulation of parallel computation on networks of workstations ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra

Cites Work

• Efficient out-of-core algorithms for linear relaxation using blocking covers
• Work-preserving emulations of fixed-connection networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient out-of-core algorithms for linear relaxation using blocking covers