Precedence Constraints
Mostrando 1-7 de 7 artigos, teses e dissertações.
-
1. Constraint-driven test scheduling for NoC-based systems
On-chip integrated network, the so-called networkon- chip (NoC), is becoming a promising communication paradigm for the next-generation embedded core-based system chips. The reuse of the on-chip network as test access mechanism has been recently proposed to handle the growing complexity of testing NoC-based systems. However, the NoC reuse is limited by the o
Publicado em: 2011
-
2. Algoritmos para escalonamento de tarefas dependentes representadas por grafos acíclicos direcionados em grades computacionais / Scheduling algorithms for dependent tasks represented by directed acyclic graphs on computational grids
Computational grids are potentially large distributed systems composed of heterogeneous resources connected by a network with heterogeneous links. These systems became largely used in the execution of tasks which require large processing capacities. Because they are shared systems, task submission in grids independently originate from a number of users, lead
Publicado em: 2010
-
3. REFINERY SCHEDULING OPTIMIZATION USING GENETIC ALGORITHMS AND COOPERATIVE COEVOLUTION / OTIMIZAÇÃO DA PROGRAMAÇÃO DA PRODUÇÃO EM REFINARIAS DE PETRÓLEO UTILIZANDO ALGORITMOS GENÉTICOS E CO-EVOLUÇÃO COOPERATIVA
This work investigates the use of Genetic Algorithms and Cooperative Coevolution in refinery scheduling optimization. Oil refineries are one of the most important examples of multiproduct continuous plants, that is, a continuous processing system that generates a number of products simultaneously. A refinery processes various crude oil types and produces a w
Publicado em: 2004
-
4. OTIMIZAÇÃO DE PLANEJAMENTOS COM RESTRIÇÃO DE PRECEDÊNCIA USANDO ALGORITMOS GENÉTICOS E CO-EVOLUÇÃO COOPERATIVA / SCHEDULE OPTIMIZATION WITH PRECEDENCE CONSTRAINTS USING GENETIC ALGORITHMS AND COOPERATIVE CO-EVOLUTION
Esta dissertação investiga o uso de Algoritmos Genéticos e de Co-Evolução Cooperativa na otimização de problemas de planejamento com restrições de precedência. Neste tipo de problema algumas ou todas as tarefas têm restrições que implicam na necessidade de planejá-las ou executá-las antes ou depois de outras. Por esta razão, o uso de modelos
Publicado em: 2003
-
5. A note on the complexity of scheduling coupled tasks on a single processor
This paper considers a problem of coupled task scheduling on one processor, where all processing times are equal to 1, the gap has exact length h, precedence constraints are strict and the criterion is to minimise the schedule length. This problem is introduced e.g. in systems controlling radar operations. We show that the general problem is NP-hard.
Journal of the Brazilian Computer Society. Publicado em: 2001
-
6. Escalonamento dinamico de tarefas periodicas e esporadicas
Nowadays, the design and implementation of Hard Real-Time(HRT) Systems can only be accomplished through a formal methodological approach. These HRT systems are based upon the fact that the quantitative temporal behaviour must be meto Otherwise, severe negative consequences may occur and be spread in the environment. Such behaviour is due to the fact that HRT
Publicado em: 1994
-
7. Adaptation at Specific Loci. IV. Differential Mating Success among Glycolytic Allozyme Genotypes of Colias Butterflies
Male mating success as a function of genotype is an important fitness component. It can be studied in wild populations, in species for which a given group of progeny has exactly one father, by determining genotypes of wild-caught mothers and of sufficient numbers of their progeny. Here, we study male mating success as a function of allozyme genotype at two g