Open AccessBook
Algorithm Design for Computer System Design
Reads0
Chats0
TLDR
The paper presents a model for optimum partitioning of tasks over a multiple-processor system and the algorithmic approaches to the problem are briefly described.Abstract:
MODELS OF THE TASK ASSIGNMENT PROBLEM IN DISTRIBUTED SYSTEMS Mario Lucertini Dipartirnento di Informatica e Sistemistica dell'Universiti di Roma e Istituto di Analisi dei Sistemi ed Informatica del C.N.R., Viale Manzoni 30, 00185, Roma The paper presents a model for optimum partitioning of tasks over a multiple-processor system. The minimization of the interprocessor. communications overhead and/or the message average delay are considered as a design criterion. The algorithmic approaches to the problem are briefly described and improuvements to the case of multiple copies of tasks are considered. A large set of references covering the area are included.read more
Citations
More filters
Proceedings ArticleDOI
The Current State and Future of Search Based Software Engineering
TL;DR: The paper briefly reviews widely used optimization techniques and the key ingredients required for their successful application to software engineering, providing an overview of existing results in eight software engineering application domains.
Journal ArticleDOI
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
TL;DR: This paper presents a new best-fit heuristic for the two-dimensional rectangular stock-cutting problem and demonstrates its effectiveness by comparing it against other published approaches and suggesting an efficient implementation of this heuristic.
Journal ArticleDOI
BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem
TL;DR: In this article, an exact hybrid solution procedure, called BISON, is proposed for solving BPP-1, which combines the well-known meta-strategy tabu search and a branch and bound procedure based on known and new bound arguments and a new branching scheme.
Posted Content
BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem
TL;DR: For solving BPP-1, an exact hybrid solution procedure, called BISON, is proposed, which favourably combines the well-known meta-strategy tabu search and a branch and bound procedure based on known and new bound arguments and a new branching scheme.
Journal ArticleDOI
A Strip-Packing Algorithm with Absolute Performance Bound 2
TL;DR: A new approximation algorithm for packing rectangles into a strip with unit width and unbounded height so as to minimize the total height of the packing.
References
More filters
Journal ArticleDOI
On the criteria to be used in decomposing systems into modules
TL;DR: In this paper, the authors discuss modularization as a mechanism for improving the flexibility and comprehensibility of a system while allowing the shortening of its development time, and the effectiveness of modularization is dependent upon the criteria used in dividing the system into modules.
Kommunikation mit Automaten
TL;DR: The theory of automata is shown not capable of representing the actual physical flow of information in the solution of a recursive problem and a theory of communication is proposed that yields a means of representation that with equal rigor and simplicity accomplishes more than the theory of synchronous automata.
Journal ArticleDOI
An Algorithm for Path Connections and Its Applications
TL;DR: The algorithm described in this paper is the outcome of an endeavor to answer the following question: Is it possible to find procedures which would enable a computer to solve efficiently path-connection problems inherent in logical drawing, wiring diagramming, and optimal route finding?
A separator theorem for planar graphs
TL;DR: In this paper, it was shown that the vertices of a planar graph can be partitioned into three sets A,B,C such that no edge joins a vertex in A with another vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than $2.