✦ LIBER ✦

Parallel static and dynamic multi-constraint graph partitioning

✍ Scribed by Kirk Schloegel; George Karypis; Vipin Kumar

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 227 KB
Volume: 14
Category: Article
ISSN: 1532-0626
DOI: 10.1002/cpe.605

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Static and Dynamic Path Selection on Exp

Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach

✍ Andrei Z. Broder; Alan M. Frieze; Eli Upfal 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 2 views

This paper addresses the problem of virtual circuit switching in bounded degree expander graphs. We study the static and dynamic versions of this problem. Our solutions are based on the rapidly mixing properties of random walks on expander graphs. In the static version of the problem an algorithm is

Design of a WSI scale parallel processor

Design of a WSI scale parallel processor for intelligent robot control based on a dynamic reconfiguration of multi-operand arithmetic units

✍ Yoshichika Fujioka; Nobuhiro Tomabechi 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB 👁 1 views

A restructurable (reconfigurable) parallel VLSI processor designed to minimize the operation delay time which can be generally used for various operations necessary for controlling an intelligent robot was proposed previously by the authors. This processor is constructed by connecting a number of pr