30973700
Allocation cost minimization for periodic hard real-time tasks in energy-constrained DVS systems
5871408
Leakage-Aware Energy-Efficient Scheduling of Real-Time Tasks in Multiprocessor Systems
This work targets energy-efficient scheduling of periodic real-time tasks over multiple DVS processors with the considerations of power consumption due to leakage current. A polynomial-time algorithm with a 1.283 approximation bound is proposed when the overheads in turning on/off a processor are negligible. When the overheads are non-negligible, we develop polynomial-time algorithms with a 2 approximation bound. A series of simulation experiments was done for the performance evaluation of the proposed algorithms. The simulation results show that the proposed algorithms could derive schedules very close to optimal solutions.
2587881
Isomap Based on the Image Euclidean Distance
Scientists find that the human perception is based on the similarity on the manifold of data set. Isometric feature mapping (isomap) is one of the representative techniques of manifold. It is intuitive, well understood and produces reasonable mapping results. However, if the input data for manifold learning are corrupted with noises, the isomap algorithm is topologically unstable. In this paper, we present an improved manifold learning method when the input data are images - the image Euclidean distance based isomap (imisomap), in which we use a new distance for images called image Euclidean distance (IMED). Experimental results demonstrate a consistent performance improvement of the algorithm imisomap over the traditional isomap based on Euclidean distance
31382426
Strong Fault-Tolerance: Parallel Routing in Networks with Faults
A d-regular network G is strongly fault-tolerant if for any copy Gf of G with at most d - 2 faulty nodes, every pair of nonfaulty nodes u and v in Gf admits min{df(u), df (v)} node-disjoint paths in Gf from u to v, where df(u) and df(v) are the degrees of the nodes u and v in Gf. We show that popular network structures, such as hypercube and star networks, are strongly fault-tolerant. We develop efficient algorithms that construct the maximum number of node-disjoint paths of optimal or nearly optimal length in these networks with faulty nodes. Our algorithms are optimal in terms of their running time.
44298104
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
26308486
Model checking real-time value-passing systems
In this paper, to model check real-time value-passing systems, a formal languageTimed Symbolic Transition Graph and a logic system namedTimed Predicate μ-Calculus are proposed. An algorithm is presented which is local in that it generates and investigates the reachable state space in top-down fashion and maintains the partition for time evaluations as coarse as possible whileon-the-fly instantiating data variables. It can deal with not only data variables with finite value domain, but also the so calleddata independent variables with infinite value domain. To authors knowledge, this is the first algorithm for model checking timed systems containing value-passing features.
39815337
Making Timed Automata Communicate
A computation model is introduced in which real-time constraints as well as data communications can be explicitely expressed. The model is presented in a graphical form. Its semantics is studied and algorithms to compute bisimulation equivalences for such graphs are proposed.