14 resultados para PDP
em QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast
Resumo:
<p>We address the issue of autonomic management in hierarchical component-based distributed systems. The long term aim is to provide a modelling framework for autonomic management in which QoS goals can be defined, plans for system adaptation described and proofs of achievement of goals by (sequences of) adaptations furnished. Here we present an early step on this path. We restrict our focus to skeleton-based systems in order to exploit their well-defined structure. The autonomic cycle is described using the Orc system orchestration language while the plans are presented as structural modifications together with associated costs and benefits. A case study is presented to illustrate the interaction of managers to maintain QoS goals for throughput under varying conditions of resource availability.</p>
Resumo:
A reflex discharge plasma, obtained as a hybrid between a Penning discharge plasma (PDP) and a hollow-cathode discharge (HCD) plasma, is analysed as a possible direction-current, high-density plasma source. The experiment is run in oxygen at pressures of 10 mTorr and 1 mTorr, and for discharge currents of 100 to 200 mA. Although the gas pressure is considerably lower than those used in HCDs, the hollow-cathode effect (HCE) occurs for current levels higher than 100 mA and leads to plasma densities comparable with those obtained using inductive plasma sources. The presence of a constant magnetic field leads to the enhancement of electron emission from cathodes under ion bombardment, and to the decreasing of the ion loss by diffusion to the wall.
Resumo:
Autonomic management can be used to improve the QoS provided by parallel/distributed applications. We discuss behavioural skeletons introduced in earlier work: rather than relying on programmer ability to design from scratch efficient autonomic policies, we encapsulate general autonomic controller features into algorithmic skeletons. Then we leave to the programmer the duty of specifying the parameters needed to specialise the skeletons to the needs of the particular application at hand. This results in the programmer having the ability to fast prototype and tune distributed/parallel applications with non-trivial autonomic management capabilities. We discuss how behavioural skeletons have been implemented in the framework of GCM(the Grid ComponentModel developed within the CoreGRID NoE and currently being implemented within the GridCOMP STREP project). We present results evaluating the overhead introduced by autonomic management activities as well as the overall behaviour of the skeletons. We also present results achieved with a long running application subject to autonomic management and dynamically adapting to changing features of the target architecture. <br/>Overall the results demonstrate both the feasibility of implementing autonomic control via behavioural skeletons and the effectiveness of our sample behavioural skeletons in managing the functional replication pattern(s).
Resumo:
Data flow techniques have been around since the early '70s when they were used in compilers for sequential languages. Shortly after their introduction they were also consideredas a possible model for parallel computing, although the impact here was limited. Recently, however, data flow has been identified as a candidate for efficient implementation of various programming models on multi-core architectures. In most cases, however, the burden of determining data flow "macro" instructions is left to the programmer, while the compiler/run time system manages only the efficient scheduling of these instructions. We discuss a structured parallel programming approach supporting automatic compilation of programs to macro data flow and we show experimental results demonstrating the feasibility of the approach and the efficiency of the resulting "object" code on different classes of state-of-the-art multi-core architectures. The experimental results use different base mechanisms to implement the macro data flow run time support, from plain pthreads with condition variables to more modern and effective lock- and fence-free parallel frameworks. Experimental results comparing efficiency of the proposed approach with those achieved using other, more classical, parallel frameworks are also presented. 2012 IEEE.
Resumo:
Presents the introductory welcome message from the conference proceedings.
Resumo:
Il presente lavoro intende individuare le possibili configurazioni di Piano della Performance (PdP) utilizzabili dagli enti locali, provvedendo poi a delineare il livello di distribuzione e di allineamento dei PdP 2011-2013 dei Comuni medi e grandi rispetto alle suddette configurazioni. Inoltre, verr valutato, tramite una griglia predisposta dagli autori, il livello di adeguatezza programmatica dei Piani della Performance dei Comuni medi e grandi, al fine di confermare le configurazioni esistenti o di proporne una nuova in caso di inadeguatezza delle prime.
Resumo:
Il D.Lgs. 150/09 ha inteso dar vita ad una riforma organica della PA italiana, improntandone il funzionamento a logiche di programmazione e controllo delle performance. Attorno a tale concetto la riforma ha costruito un Sistema teso a programmare, misurare, controllare, valutare e comunicare la performance degli enti. Il lavoro si focalizza sulla programmazione, e in particolare sullo strumento cardine introdotto dal D.Lgs. 150/09: il Piano della Performance (PdP). Il contributo, basato su una metodologia deduttivo-induttiva, si concentra sui comuni medi italiani, scelti in quanto statisticamente rappresentativi del livello medio di complessit degli enti locali. Sono stati oggetto di indagine i PdP pubblicati sui siti istituzionali degli enti considerati, al fine di verificarne sia il livello di aderenza alle Linee Guida (LG) emanate dalla Commissione Indipendente per la Valutazione, la Trasparenza e lIntegrit delle amministrazioni pubbliche (CIVIT) e dalla Associazione Nazionale Comuni Italiani (ANCI), sia il loro livello di adeguatezza economico-aziendale. Preliminarmente si indagher il tema della programmazione, sotto il profilo normativo-dottrinale, concentrandosi su soggetti, processi e strumenti. Poi si sposter il focus sul PdP: dopo aver definito obiettivi, quesiti e metodologia della ricerca, verranno esplicitate le configurazioni di PdP emergenti dalle LG CIVIT e ANCI. Verranno poi illustrati i risultati della ricerca empirica, mettendo in luce il livello di allineamento dei PdP dei comuni medi alle LG, nonch il livello di adeguatezza economico-aziendale degli stessi. Si tratteggeranno quindi alcune brevi conclusioni.
Resumo:
<p>Heterogeneous computing technologies, such as multi-core CPUs, GPUs and FPGAs can provide significant performance improvements. However, developing applications for these technologies often results in coupling applications to specific devices, typically through the use of proprietary tools. This paper presents SHEPARD, a compile time and run-time framework that decouples application development from the target platform and enables run-time allocation of tasks to heterogeneous computing devices. Through the use of special annotated functions, called managed tasks, SHEPARD approximates a task's performance on available devices, and coupled with the approximation of current device demand, decides which device can satisfy the task with the lowest overall execution time. Experiments using a task parallel application, based on an in-memory database, demonstrate the opportunity for automatic run-time task allocation to achieve speed-up over a static allocation to a single specific device. 2014 IEEE.</p>
Resumo:
<p>Structured parallel programming, and in particular programming models using the algorithmic skeleton or parallel design pattern concepts, are increasingly considered to be the only viable means of supporting effective development of scalable and efficient parallel programs. Structured parallel programming models have been assessed in a number of works in the context of performance. In this paper we consider how the use of structured parallel programming models allows knowledge of the parallel patterns present to be harnessed to address both performance and energy consumption. We consider different features of structured parallel programming that may be leveraged to impact the performance/energy trade-off and we discuss a preliminary set of experiments validating our claims.</p>