Job phasing aware preemption deferral

Preemptions account for a non-negligible overhead during system execution. There has been substantial amount of research on estimating the delay incurred due to the loss of working sets in the processor state (caches, registers, TLBs) and some on avoiding preemptions, or limiting the preemption cost. We present an algorithm to reduce preemptions by further delaying the start of execution of high priority tasks in fixed priority scheduling. Our approaches take advantage of the floating non-preemptive regions model and exploit the fact that, during the schedule, the relative task phasing will differ from the worst-case scenario in terms of admissible preemption deferral. Furthermore, approximations to reduce the complexity of the proposed approach are presented. Substantial set of experiments demonstrate that the approach and approximations improve over existing work, in particular for the case of high utilisation systems, where savings of up to 22% on the number of preemption are attained.

Notional processors: an approach for multiprocessor scheduling

Consider the problem of designing an algorithm with a high utilisation bound for scheduling sporadic tasks with implicit deadlines on identical processors. A task is characterised by its minimum interarrival time and its execution time. Task preemption and migration is permitted. Still, low preemption and migration counts are desirable. We formulate an algorithm with a utilisation bound no less than 66.¯6%, characterised by worst-case preemption counts comparing favorably against the state-of-the-art.

Sporadic multiprocessor scheduling with few preemptions

Consider the problem of scheduling n sporadic tasks so as to meet deadlines on m identical processors. A task is characterised by its minimum interarrival time and its worst-case execution time. Tasks are preemptible and may migrate between processors. We propose an algorithm with limited migration, configurable for a utilisation bound of 88% with few preemptions (and arbitrarily close to 100% with more preemptions).

CPMD-mindful task assignment for NPS-F

The multiprocessor scheduling scheme NPS-F for sporadic tasks has a high utilisation bound and an overall number of preemptions bounded at design time. NPS-F binpacks tasks offline to as many servers as needed. At runtime, the scheduler ensures that each server is mapped to at most one of the m processors, at any instant. When scheduled, servers use EDF to select which of their tasks to run. Yet, unlike the overall number of preemptions, the migrations per se are not tightly bounded. Moreover, we cannot know a priori which task a server will be currently executing at the instant when it migrates. This uncertainty complicates the estimation of cache-related preemption and migration costs (CPMD), potentially resulting in their overestimation. Therefore, to simplify the CPMD estimation, we propose an amended bin-packing scheme for NPS-F allowing us (i) to identify at design time, which task migrates at which instant and (ii) bound a priori the number of migrating tasks, while preserving the utilisation bound of NPS-F.

Cartografia de zonamento geotécnico no apoio ao planeamento e valorização da exploração do georrecurso: o caso do maciço rochoso da Curviã (Joane)

Este trabalho centra-se no estudo do aproveitamento expectável do maciço rochoso da pedreira da Curviã N.o 2 (Joane, Vila Nova de Famalicão, no N Portugal), através da obtenção de um bloco unitário tipo que forneça indicações para a exploração do recurso geológico para fins industriais e/ou ornamentais. Desta forma, investiga-se se num dado limite de zona geotécnica do maciço rochoso e propicio a obtenção de blocos com dimensão, avaliados apos o processo de transformação, nomeadamente, para enrocamento em obras marítimas ou balastro em obras ferroviárias. Foram seleccionados diversos afloramentos, tendo-se recorrido a técnica de amostragem linear as superfícies expostas do maciço. Esta técnica e uma das formas mais expeditas de coligir dados geológico-geotécnicos relativos as descontinuidades. Procedeu-se, ainda, a um tratamento estatístico das descontinuidades, bem como dos parâmetros geológico-geotécnicos e geomecânicos a estas associadas, propostos pela Sociedade Internacional de Mecânica das Rochas (ISRM). Todos os dados foram representados cartograficamente numa base apoiada pelos Sistemas de Informação Geográfica (SIG) e utilizadas as ferramentas de geologia estrutural, analise morfotectónica, modelação digital de terreno e cartografia de zonamento geotécnico. O zonamento geotécnico do maciço granítico foi realizado sempre em estreita ligação com o conhecimento das características do maciço ”in situ”. Pretende-se que esta metodologia contribua para um melhor conhecimento da compartimentação dos maciços rochosos em geral e, em particular, do modelo geotécnico comportamental do maciço rochoso da Curviã N.o2.