936 resultados para articial boundary inhomogeneity
Resumo:
Nowadays, many real-time operating systems discretize the time relying on a system time unit. To take this behavior into account, real-time scheduling algorithms must adopt a discrete-time model in which both timing requirements of tasks and their time allocations have to be integer multiples of the system time unit. That is, tasks cannot be executed for less than one time unit, which implies that they always have to achieve a minimum amount of work before they can be preempted. Assuming such a discrete-time model, the authors of Zhu et al. (Proceedings of the 24th IEEE international real-time systems symposium (RTSS 2003), 2003, J Parallel Distrib Comput 71(10):1411–1425, 2011) proposed an efficient “boundary fair” algorithm (named BF) and proved its optimality for the scheduling of periodic tasks while achieving full system utilization. However, BF cannot handle sporadic tasks due to their inherent irregular and unpredictable job release patterns. In this paper, we propose an optimal boundary-fair scheduling algorithm for sporadic tasks (named BF TeX ), which follows the same principle as BF by making scheduling decisions only at the job arrival times and (expected) task deadlines. This new algorithm was implemented in Linux and we show through experiments conducted upon a multicore machine that BF TeX outperforms the state-of-the-art discrete-time optimal scheduler (PD TeX ), benefiting from much less scheduling overheads. Furthermore, it appears from these experimental results that BF TeX is barely dependent on the length of the system time unit while PD TeX —the only other existing solution for the scheduling of sporadic tasks in discrete-time systems—sees its number of preemptions, migrations and the time spent to take scheduling decisions increasing linearly when improving the time resolution of the system.
Resumo:
Mestrado em Engenharia Electrotécnica e de Computadores - Área de Especialização em Automação e Sistemas
Resumo:
Dissertação para obtenção do Grau de Doutor em Matemática
Semantic web approach for dealing with administrative boundary revisions: a case study of Dhaka City
Resumo:
Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.
Resumo:
Much of the information of historical documents about the territory and property are defined on textual form. This information is mostly geographic and defines territorial areas, its limits and boundaries. For the treatment of this data, we have defined one information system where the treatment of the documental references for the study of the settlement and landscape implies a systematization of the information, normalization, integration and graphic and cartographic representation. This methodology was applied to the case study of the boundary of the monastery-diocese of Dume, in Braga - Portugal, for which there are countless documents and references to this site, but where the urban pressure has mischaracterized very significantly the landscape, making the identification of territorial limits quite difficult. The work carried out to give spatial and cartographic expression to the data, by defining viewing criteria according to the recorded information, proved to be a central working tool in the boundary study and in understanding the dynamics of the sites in the various cultural periods.
Resumo:
v.2 pt.1:Cactaceae
Resumo:
3
Resumo:
2
Resumo:
1
Resumo:
Magdeburg, Univ., Fak. für Mathematik, kumulative Habil.-Schr., 2011
Resumo:
Magdeburg, Univ., Fak. für Maschinenbau, Diss., 2014
Resumo:
Magdeburg, Univ., Fak. für Mathematik, Diss., 2015
Resumo:
2
Resumo:
3
Resumo:
In this paper, a new class of generalized backward doubly stochastic differential equations is investigated. This class involves an integral with respect to an adapted continuous increasing process. A probabilistic representation for viscosity solutions of semi-linear stochastic partial differential equations with a Neumann boundary condition is given.