Special cases of online parallel job scheduling

In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, where the next job becomes known as soon as the current job is scheduled. The objective is to minimize the makespan. For the problem with three machines we give a 2.8-competitive algorithm, improving upon the 3-competitive greedy algorithm. For the special case with arbitrary number of machines, where the jobs appear in non-increasing order of machine requirement, we give a 2.4815-competitive algorithm, improving the 2.75-competitive greedy algorithm

Run-time adaptation of a reconfigurable mobile UMTS receiver

UMTS receivers are mobile devices, which should have a low energy consumption and operates in a frequently changing environment. The idea of this paper is to adapt the amount of signal processing for the reception within an UMTS mobile to this changing environment. In this way the amount of signal processing can be decreased for a good channel to decrease the energy consumption and for a bad channel the signal processing can be increased to guarantee a minimum Quality of Service for the signal. Due to space limitation, this paper only describes the approach. For full details see [1]

Detection of time reversibility in time series by ordinal patterns analysis

Time irreversibility is a common signature of nonlinear processes, and a fundamental property of non-equilibrium systems driven by non-conservative forces. A time series is said to be reversible if its statistical properties are invariant regardless of the direction of time. Here we propose the Time Reversibility from Ordinal Patterns method (TiROP) to assess time-reversibility from an observed finite time series. TiROP captures the information of scalar observations in time forward, as well as its time-reversed counterpart by means of ordinal patterns. The method compares both underlying information contents by quantifying its (dis)-similarity via Jensen-Shannon divergence. The statistic is contrasted with a population of divergences coming from a set of surrogates to unveil the temporal nature and its involved time scales. We tested TiROP in different synthetic and real, linear and non linear time series, juxtaposed with results from the classical Ramsey's time reversibility test. Our results depict a novel, fast-computation, and fully data-driven methodology to assess time-reversibility at different time scales with no further assumptions over data. This approach adds new insights about the current non-linear analysis techniques, and also could shed light on determining new physiological biomarkers of high reliability and computational efficiency.Comment: 8 pages, 5 figures, 1 tabl

Run-time Mapping of Applications to a Heterogeneous SoC

This paper presents an iterative hierarchical approach to map an application to a parallel heterogeneous SoC architecture at run-time. The application is modeled as a set of communicating processes. The optimization objective is to minimize the energy consumption of the SoC, while still providing the required Quality of Service. This approach is flexible, scalable and the performance looks promisin

BER estimation for wireless links using BPSK/QPSK modulation

This paper introduces a method that computes an estimation of the bit error rate (BER) based on the RAKE receiver soft output only. For this method no knowledge is needed about the channel characteristics nor the precise external conditions. Simulations show that the mean error of the estimation is below 2%, with only a small variance. Also an estimation of the BER for a different spreading factor or a different number of RAKE finger can be made. Implementation issues for a practical use of the method are discussed

Energy-efficient wireless communication for mobile multimedia terminals

This paper presents a control system that adapts a WCDMA receiver at run-time to minimize the energy consumption while providing an adequate Quality of Service (QoS). The adaptation is done at run-time, because of the dynamic environment of a mobile receiver. Simulations show that run-time adaptation to the environment decreases the energy consumption of a receiver and also improves other QoS parameters, such as a higher throughput and a lower frame error rate

Charmed Hadrons from Strangeness-rich QGP

The yields of charmed hadrons emitted by strangeness rich QGP are evaluated within chemical non-equilibrium statistical hadronization model, conserving strangeness, charm, and entropy yields at hadronization.Comment: 6 pages, 2 figures SQM 2006; the same as J. Phys. G in pres

Algorithms for balancing demand-side load and micro-generation in Islanded Operation

Micro-generators are devices installed in houses pro-\ud ducing electricity at kilowatt level. These appliances can\ud increase energy efficiency significantly, especially when\ud their runtime is optimized. During power outages micro-\ud generators can supply critical systems and decrease dis-\ud comfort.\ud In this paper a model of the domestic electricity infras-\ud tructure of a house is derived and first versions of algo-\ud rithms for load/generation balancing during a power cut\ud are developed. In this context a microCHP device, produc-\ud ing heat and electricity at the same time with a high effi-\ud ciency, is used as micro-generator.\ud The model and the algorithms are incorporated in a sim-\ud ulator, which is used to study the effect of the algorithms for\ud load/generation balancing. The results show that with some\ud extra hardware all appliances in a house can be supplied,\ud however not always at the preferred time.\u