989 resultados para BD


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertation presented to obtain the Ph.D degree in Biology

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertation presented to obtain the Ph.D degree in Molecular Biology

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertation presented to obtain the Ph.D. degree in Biology

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertation presented to obtain a Doctoral degree in Biology by Instituto de Tecnologia Química e Biológica

Relevância:

10.00% 10.00%

Publicador:

Resumo:

11th IEEE World Conference on Factory Communication Systems (WFCS 2015). 27 to 29, May, 2015, TII-SS-2: Scheduling and Performance Analysis. Palma de Mallorca, Spain.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Distributed real-time systems such as automotive applications are becoming larger and more complex, thus, requiring the use of more powerful hardware and software architectures. Furthermore, those distributed applications commonly have stringent real-time constraints. This implies that such applications would gain in flexibility if they were parallelized and distributed over the system. In this paper, we consider the problem of allocating fixed-priority fork-join Parallel/Distributed real-time tasks onto distributed multi-core nodes connected through a Flexible Time Triggered Switched Ethernet network. We analyze the system requirements and present a set of formulations based on a constraint programming approach. Constraint programming allows us to express the relations between variables in the form of constraints. Our approach is guaranteed to find a feasible solution, if one exists, in contrast to other approaches based on heuristics. Furthermore, approaches based on constraint programming have shown to obtain solutions for these type of formulations in reasonable time.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A Thesis submitted for the co-tutelle degree of Doctor in Physics at Universidade Nova de Lisboa and Université Pierre et Marie Curie

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertação para obtenção do Grau de Doutor em Biologia

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Demo in Workshop on ns-3 (WNS3 2015). 13 to 14, May, 2015. Castelldefels, Spain.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper, we propose the Distributed using Optimal Priority Assignment (DOPA) heuristic that finds a feasible partitioning and priority assignment for distributed applications based on the linear transactional model. DOPA partitions the tasks and messages in the distributed system, and makes use of the Optimal Priority Assignment (OPA) algorithm known as Audsley’s algorithm, to find the priorities for that partition. The experimental results show how the use of the OPA algorithm increases in average the number of schedulable tasks and messages in a distributed system when compared to the use of Deadline Monotonic (DM) usually favoured in other works. Afterwards, we extend these results to the assignment of Parallel/Distributed applications and present a second heuristic named Parallel-DOPA (P-DOPA). In that case, we show how the partitioning process can be simplified by using the Distributed Stretch Transformation (DST), a parallel transaction transformation algorithm introduced in [1].

Relevância:

10.00% 10.00%

Publicador:

Resumo:

13th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC 2015). 21 to 23, Oct, 2015, Session W1-A: Multiprocessing and Multicore Architectures. Porto, Portugal.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A thesis submitted for the degree of Ph. D. in Physics

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertação para obtenção do Grau de Doutor em Química, especialidade Química Orgânica

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Paper/Poster presented in Work in Progress Session, 28th GI/ITG International Conference on Architecture of Computing Systems (ARCS 2015). 24 to 26, Mar, 2015. Porto, Portugal.