Minimum-perimeter domain assignment

DOI10.1007/BF02614375zbMath0890.90177OpenAlexW2066407696MaRDI QIDQ1373754

Jonathan Yackel, Robert R. Meyer, Ioannis T. Christou

Publication date: 25 November 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02614375

zbMATH Keywords

assignment of grid cellsminimizing interprocessor communicationminimum-perimeter tilesnonlinear network model

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Fast equi-partitioning of rectangular domains using stripe decomposition

Uses Software

• MESHPART

Cites Work

• Coding the convex polyominoes and equations for the enumeration according to the area
• Optimal equi-partition of rectangular domains for parallel computation
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Encoding Data Structures in Trees
• Domain decomposition methods in computational fluid dynamics
• An Efficient Heuristic Procedure for Partitioning Graphs
• Optimal Balanced Assignments and a Parallel Database Application
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum-perimeter domain assignment