We consider the problem of schedulingpermanent jobs on related machines in an on-line fashion. We design a new algorithm that achieves the competitive ratio of for the deterministic version, and for its randomized variant, improving the previous competitive ratios of 8 and ! " # . We also prove lower bounds of $ on the competitive ratio of deterministic algorithms and % on the competitive ratio...

This paper proposes an evolutionary approach to Bandgap Voltage Reference (BVR) design. The efficiency and feasibility of this method for solving the circuit design task are investigated. For demonstration purpose, two sub-1V BVR circuits are chosen. Circuit optimization is performed for various algorithm options. We have compared the design results obtained for purely random and deterministic ...

Fully adaptive routing with less virtual channels is of technical trend in MPP interconnection network design. However, imbalance of load offsets performances of many schemes. In this paper we give a fully adaptive load balanced routing algorithm called VBMAR. A new design tool called crossed turn model (CTM) is proposed to solve complex deadlock problems across virtual networks while keep the ...

A locally threshold testable language L is a language with the property that for some nonnegative integers k and l, whether or not a word u is in the language L depends on (1) the preex and suux of the word u of length k?1 and (2) the set of intermediate substrings of length k of the word u where the sets of substrings occurring at least j times are the same, for j l. For given k and l the lang...

Abstract: Engineering optimization problems are normally formulated as nonlinear programming problems and adopted in a lot of research to show the effectiveness of new optimization algorithms. These problems are usually solved through deterministic or heuristic methods. Because non-convex functions exist in most engineering optimization problems that possess multiple local optima, the heuristic...

We adapt techniques employed in the design of parallel sorting algorithms to propose new sequential and multi-core sorting operations. The proposed approach is used to develop asymptotically efficient deterministic and randomized sorting operations whose practical sequential and multi-core performance, as witnessed by an experimental study, matches or surpasses existing optimized sorting algori...

Implementing correct and deterministic parallel programs is challenging. Even though concurrency constructs exist in popular programming languages to facilitate the task of deterministic parallel programming, they are often too low level, or do not compose well due to underlying blocking mechanisms. In this paper, we present the design and implementation of a fundamental data structure for comp...

In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...