One-dimensional optimization on multiprocessor systems
نویسندگان
چکیده
منابع مشابه
One-dimensional Optimization on Non-archimedean Fields
One dimensional optimization on non-Archimedean fields is presented. We derive first and second order necessary and sufficient optimality conditions. For first order optimization, these conditions are similar to the corresponding real ones; but this is not the case for higher order optimization. This is due to the total disconnectedness of the given non-Archimedean field in the order topology, ...
متن کاملScheduling Optimization for Vector Graphics Acceleration on Multiprocessor Systems
In recent years, the number of processor cores on one platform has largely increased, while evenly distributing jobs to every processor becomes an important issue. Most previously discussed scheduling situations were well defined in general cases. In this paper, we propose an algorithm, which is modified from Heterogeneous Earliest Finished Time (HEFT), to increase the performance of a homogene...
متن کاملOn-Line Optimization Techniques for Task Scheduling in Multiprocessor Systems
Efficiently scheduling parallel tasks on to the processors of a multiprocessor system is critical to achieving high performance. Given perfect information at compile-time, a static scheduling strategy can produce an assignment of tasks to processors that ideally balances the load among the processors while minimizing the run-time scheduling overhead and the average memory referencing delay. Sin...
متن کاملOn the Simulation Optimization of One-dimensional Convex Functions
We present specialized algorithms for minimizing one-dimensional convex functions that can only be observed using a consistent estimator. We make no distributional assumptions on the estimator. The algorithms converge to the correct solution with probability one under certain conditions, choose parameters automatically, and exhibit better finite-time performance than existing general purpose al...
متن کاملDrawing Directed Graphs Using One-Dimensional Optimization
We present an algorithm for drawing directed graphs, which is based on rapidly solving a unique one-dimensional optimization problem for each of the axes. The algorithm results in a clear description of the hierarchy structure of the graph. Nodes are not restricted to lie on fixed horizontal layers, resulting in layouts that convey the symmetries of the graph very naturally. The algorithm can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 1981
ISSN: 0018-9340
DOI: 10.1109/tc.1981.6312157