Prokrastinering är en komplex process där både affektiva, kognitiva och beteendemässiga komponenter involveras. Prokrastinering är ett känt fenomen i arbetslivet.  Prevalensen är hög bland anställda, därför har fokus på fenomenet legat på just den populationen. Syfte är undersöka om det finns ett samband mellan prokrastinering och personlighetsfaktorer, samt prokrastinering och arbetstillfredsställelse hos anställda i Sverige. Deltagare var 98 anställda.  Deltagarna besvarade en enkät som bestod av Big Five Markers (BFM) skala, Pure procrastination scale (PPS) skala samt Minnesota Satisfaction Questionnaire (MSQ). Materialet analyserades med hjälp av Pearsson korrelationer och regressionsanalyser. Studien visade på att Neuroticism och Samvetsgrannhet har samband med prokrastinering, däremot Extraversion, Vänlighet samt Öppenhet inte hade något samband med prokrastinering. Arbetstillfredsställelse, kön och ålder visade ingen samband med prokrastinering. Slutsatsen är att bristen på självdisciplin leder till prokrastinering vilket orsakar stress och depression. Framtida forskning skulle vara intressant att undersöka om det finns ett samband mellan prokrastinering, bransch samt yrkeskategori.

Nel teatro shakespeariano è molto spesso presente un uso del tempo affatto moderno e connesso con le nuove tecnologie, se si considera come moderna la presenza massiccia nel canone di una temporalità realistica e cadenzata dal movimento delle lancette dell’orologio, vero oggetto rivoluzionario del nuovo modello temporale. Tra i tanti strumenti che Shakespeare impiega per la manipolazione dell’elemento temporale a livello di drammaturgia, uno è sembrato particolarmente innovativo e rilevante: la scadenza. Si è pensato che la presenza di questo elemento in circa un quarto della produzione shakespeariana potesse rappresentare, anche solo dal punto di vista quantitativo, un dato interessante e meritevole di esame approfondito. Si è infatti ritenuto che l’imposizione di un limite di tempo preciso e scandito dall'orologio all’interno del dramma testimoni non soltanto la sussistenza di un nuovo approccio alla temporalità, ma anche la familiarità del pubblico con un nuovo modo di pensare il tempo. Si è considerato inoltre che il legame tra la scadenza e una nuova concezione del tempo potesse risultare con maggiore evidenza mettendola a confronto con un altro elemento, rappresentativo invece di un pensiero più tradizionale: la profezia. Nella profezia si è infatti voluto vedere una sorta di antecedente della scadenza stessa, a causa di alcuni aspetti formali che le accomunano; allo stesso tempo, tuttavia, ci si è concentrati sull’aspetto che le differenzia, operante proprio sul piano temporale e tale da renderle emblematiche di due tradizioni culturali e teatrali vicine ma fondamentalmente differenti. / Shakespearian theatre often presents a use of time which is undeniably modern and connected to new technologies, if we consider as modern the presence, in the Canon, of a realistic kind of temporality, marked by the rhythm of the clock, the revolutionary object that characterizes the new temporal model. Among the techniques that Shakespeare uses to manipulate the temporal element on a dramaturgical level, one seemed to be particularly innovative and relevant: deadline. The presence of this element in about one fourth of Shakespearean production could represent, if only from a quantitative perspective, an interesting fact, worthy of in-depth analysis. The imposition of a precise time limit, marked by the clock, was thought to be a testimony both of a new approach to temporality, and of the audience's familiarity with a new way to conceive time. The connection between deadline and a new conception of time was thought to better emerge by comparing it to another element, more representative of a traditional way of thinking: prophecy. Prophecy was considered as a sort of precedent for deadline, because of some formal aspects that they have in common; at the same time, however, the work focused on their differences, that occur on the temporal level, so much so that they almost become symbols of two cultural and theatrical traditions that are close, but fundamentally different.

Thesis (M.A. (Social Work)) -- University of Limpopo, 2017 / The aim of the study was to explore the factors that contribute to occupational stress among the fire-fighters employed by the Polokwane Local Municipality, Capricorn District of Limpopo. The study focused on the following variables: working relationships, work load, nature of work, deadlines pressure and work-home balance. The nature of the study is qualitative. The study data was collected from July to September 2015. The researcher interviewed fire-fighters in Polokwane Local Municipality. An in-depth semi-structured interview was utilised as the data collection method. The instrument used in the study was a semi structured interview schedule. Data was thematically analysed. The study findings showed that working relationships, work-load, nature of work, deadline pressure and work-home balance contributed to occupational stress. The study also found that occupational stress had negative effects on both the fire-fighters and their organisation

No description available.

När plan- och bygglagen (PBL) reviderades 2011 tillfördes ett krav på kommunerna att handlägga ett bygglovsärende inom tio veckor från det att ärendet blev komplett. Det infördes dock inga sanktioner mot kommunerna om de skulle överskrida tidsfristen. Efter flera utredningar av bland andra Boverket har det visat sig att kommunerna har svårt att hålla tidsfristen. Justitieombudsmannen (JO) har flertalet gånger sedan revideringen 2011 kritiserat kommuner som inte haft en rimlig handläggningstid. Regeringen gav 2016 Boverket i uppdrag att undersöka hur kommunerna förhåller sig till tidsfristen samt att ta fram ett förslag om sanktionssystem mot byggnadsnämnden när de överskrider tio veckor. Syftet med uppdraget var att kommunerna skulle förbättra sina handläggningstider och att byggprocessen skulle bli mer effektiv. Boverket konstaterade i sin rapport att 81 procent av kommunerna klarar av att handlägga majoriteten av sina ärenden inom tidsfristen och att kommunerna succesivt har förbättrat sina handläggningstider sedan 2011 års PBL infördes. Boverket ansåg i rapporten att införandet av en reducerad bygglovsavgift var det mest lämpliga system att införa mot nämnderna. Reducering av bygglovsavgift infördes i PBL den 1 januari 2019 genom paragraf 12:8 a. Reduceringen innebär att bygglovsavgiften ska minskas med en femtedel för varje påbörjad vecka som överskrider tidsfristen. I denna studie har det undersökts vilken inverkan den nya regeln har fått på utvalda kommuner, och hur kommunerna förhåller sig till den. Studien är avgränsad genom att fokus har riktats mot bygglov utanför detaljplan, liten avvikelse inom detaljplan och vid större projekt. Studien bygger på intervjuer med bygglovschefer eller handläggare i fyra kommuner i Västra Götalands län, där tre av kommunerna valdes efter befolkning och den fjärde valdes för att representera en kommun med stor andel säsongsboende. Inför intervjuerna har de intervjuade fått till sig en intervjuguide och under intervjuerna har samma grundfrågor ställts med möjlighet till fördjupade följdfrågor. Resultatet visar att 12:8 a inte kommer att få en stor inverkan på kommunerna och därmed inte leda till en mer effektiv byggprocess. Orsaken till detta är att lagändringen är en liten del i hela kedjan med en avsaknad av tidsfrister inom andra delar av byggprocessen. Nu kommer kommunerna att flytta resurser till den del som är tidsstyrd medan andra moment i processen blir nedprioriterade. Utifrån resultatet är slutsatsen att hela byggprocessen bör ses över. Paragraferna inom själva PBL men även andra lagar bör samverka bättre med varandra, och att den vägledningen som Boverket ska ge till kommunerna bör bli tydligare då kommunerna tolkar lagar olika. Sammantaget har 12:8 a inte fått någon större påverkan på byggprocessen och PBL:s syfte om en enklare plan- och bygglag fortsätter att motverkas. / The Planning and Building act (PBL) was rewritten in 2011. A new requirement was added for the local authorities to handle building permits within ten weeks from when the applications were completed. However there were no sanctions added against the local authorities if they were to exceed the deadline of ten weeks. Several investigations performed by, for example Boverket, show that the local authorities have difficulties meeting the deadline. JO has several times, since the readjustment in 2011, complained to local authorities of their unreasonable processing time. In 2016 the government gave Boverket an assignment to investigate if the local authorities are meeting the deadlines and to propose a sanction system for the building committees, if they exceed the ten weeks. The purpose of the assignment was to improve the local authorities' processing time and to make the building process more effective. The report from Boverket showed that 81 percent of the local authorities handle a majority of the building permits within the deadline and that the processing time has improved every year since the Planning and Building act was rewritten in 2011. It was stated in the report from Boverket, that a reduction of the building permit fee was the most suitable penalty to use against the local authorities for a time violation. The reduction of the building permit fee was introduced in PBL on the first of January 2019, and was stated in paragraph 12:8 a. The penalty is structured so that every started week that exceeds the deadline, the building permit fee will be reduced by a fifth. In this study it has been analysed what impact the rule has had on four local authorities and how they interpret the rule. The study has been limited to and is only focused on building permits that are outside of the detailed plan, with minor deviance from the detailed plan and building permits for major buildings. The study is based on interviews with the manager in the department of building permit in four different local authorities located in Västra Götaland. Three of the local authorities were chosen based on size of population and the fourth was chosen to represent a local authority that has major seasonal accommodation. Before every interview the interviewees have been given an interview guide, and during the interviews the same basic questions have been asked with an opportunity to ask in-depth follow-up questions. The result showed that 12:8 a will not have a significant impact on the local authorities and therefore will not result in a more effective building process. The reason for this is that the new regulation is only a small part in the bigger picture and has a lack of deadlines in other parts of the building process. This will lead to local authorities simply moving resources to the area that has a deadline, while other steps of the process will not be as prioritized. The conclusion from these findings show that the whole building process should be looked over. The rules within PBL should be better aligned with each other and also with other laws. The guidance that Boverket gives to the local authorities should also be clearer, since local authorities can interpret the law differently. Overall, the 12:8 a paragraph will not have a big impact on the building process. The purpose of PBL on a simpler Planning and Building act continues to be sidestepped.

With multiprocessors and multicore processors becoming ubiquitous, focus has shifted from research on uniprocessors to that on multiprocessors. Results derived for the uniprocessor case unfortunately do not always directly extend to the multiprocessor case in a straightforward manner. This necessitates a paradigm shift in the approach used to design and analyse the behaviour of such processors. In the case of Real-time systems, that is, systems characterised by explicit timing constraints, analysis and performance guarantees are more important, as failure is unacceptable. Scheduling algorithms used in Real-time systems have to be carefully designed as the performance of the system depends critically on them. Efficient tests for determining if a set of tasks can be feasibly scheduled on such a computing system using a particular scheduling algorithm thus assumes importance. Traditionally, the ‘task utilization’ parameter has been used for devising such tests. Utilization based tests for Earliest Deadline First(EDF) and Rate Monotonic(RM) scheduling algorithms are known and are well understood for uniprocessor systems. In our work, we derive limits on similar bounds for the multiprocessor case. Our work diners from previous literature in that we explore the case when the individual processors constituting the multiprocessor need not be identical. Each processor in such a system is characterised by a capacity, or speed, and the time taken by a task to execute on a processor is inversely proportional to its speed. Such instances may arise during system upgradation, when faster processors may be added to the system, making it a non-identical multiprocessor, or during processor design, when the different cores on the chip may have different processing power to handle dynamic workloads. We derive results for the partitioned paradigm of multiprocessor scheduling, that is, when tasks are partitioned among the processors, and interprocessor migration after a part of execution is completed is not allowed. Results are derived for both fixed priority algorithms(RM)and dynamic priority algorithms (EDF) used on individual processors. A maximum and minimum limit on the bounds for a ‘greedy’ class of algorithms are established, since the actual value of the bound depends on the algorithm that allocates the tasks. We also derive the utilization bound of an algorithm whose bound is close to the upper limit in both cases. We find that an expression for the utilization bound can be obtained when EDF is used as the uniprocessor scheduling algorithm, but when RM is the uniprocessor scheduling algorithm,an O(mn) algorithm is required to find the utilization bound, where m is the number of tasks in the system and n is the number of processors. Knowledge of such bounds allows us to carry out very fast schedulability tests, although we have the limitation that the tests are sufficient but not necessary to ensure schedulability. We also compare the value of the bounds with those achievable in ‘equivalent’ identical multiprocessor systems and find that the performance guarantees provided by the non-identical multiprocessor system are far higher than those offered by the equivalent identical system.

Made available in DSpace on 2016-08-17T14:53:21Z (GMT). No. of bitstreams: 1 Marcio Rodrigo Melo Martins.pdf: 1449274 bytes, checksum: c55738b6ff5f13795eaa87e218fa536c (MD5) Previous issue date: 2012-04-13 / FUNDAÇÃO DE AMPARO À PESQUISA E AO DESENVOLVIMENTO CIENTIFICO E TECNOLÓGICO DO MARANHÃO / An opportunistic grid computing environment takes advantage of idle computing cycles of regular computers and workstations that can be spread across several administrative domains for running high performance applications. Opportunistic grids are usually constructed from personal computers that do not need to be dedicated for executing grid applications. The grid workload must coexist with local applications executions, submitted by the nodes regular users. Thus, its execution environment is typically dynamic, heterogeneous and unpredictable failures occur frequently. In addition, the resources of an opportunistic grid can be used at any time for the execution of local tasks, making it difficult to preview the conclusion of the tasks running on the grid nodes. These characteristics hinder the successful execution of applications for which there are time restrictions related to its completion. This thesis presents a management mechanism specifically designed for opportunistic grid computing environments for handling the execution of applications with time deadlines set by users during their submission to the system. The proposed mechanism is based on a dynamic scheduling and rescheduling approach and was evaluated using a simulated model considering various typical scenarios of opportunistic grids. The results demonstrated the benefits of the proposed approach in comparison to traditional scheduling approaches applied in opportunistic grids. / Um ambiente de computação de grade oportunista aproveita ciclos ociosos de computadores e estações de trabalho que podem ser distribuídos por vários domínios administrativos para a execução de aplicações de alto desempenho. Grades oportunistas geralmente são construídas a partir de computadores pessoais que não precisam ser dedicados para a execução de aplicações em grade. Neste tipo de grade, a carga de trabalho deve coexistir com execuções de aplicações locais submetidos pelos usuários dos nós que a compõe. Assim, seu ambiente de execução é tipicamente dinâmico, heterogêneo e imprevisível e falhas ocorrem com frequência. Além disso, os recursos de uma grade oportunista podem ser usados a qualquer momento para a execução de tarefas locais, o que torna difícil prever a conclusão das tarefas em execução nos nós da grade. Essas características dificultam a execução bem sucedida de aplicações para as quais existem restrições de tempo relacionada com a sua conclusão. Este trabalho apresenta um mecanismo de gerenciamento da execução de aplicações projetado especificamente para ambientes de computação de grade oportunista cujas aplicações possuem prazos de execução (deadline) definidos pelos usuários durante sua submissão ao sistema. O mecanismo proposto é baseado em uma abordagem dinâmica de escalonamento e reescalonamento de aplicações e foi avaliado através de um modelo de simulação levando-se em consideração vários cenários típicos de grades oportunistas. Os resultados demonstraram os benefícios da abordagem proposta em comparação com abordagens de escalonamento de aplicações tradicionalmente utilizadas em grades oportunistas.

This thesis presents and evaluates how to select the data to be logged in an embedded realtime system so as to be able to give confidence that it is possible to perform an accurate identification of the fault(s) that caused any runtime errors. Several log-selection strategies were evaluated by injecting random faults into a simulated real-time system. An instrument was created to perform accurate detection and identification of these faults by evaluating log data. The instrument’s output was compared to ground truth to determine the accuracy of the instrument. Three strategies for selecting the log entries to keep in limited permanent memory were created. The strategies were evaluated using log data from the simulated real-time system. One of the log-selection strategies performed much better than the other two: it minimized processing time and stored the maximum amount of useful log data in the available storage space. / Denna uppsats illustrerar hur det blev fastställt vad som ska loggas i ett inbäddat realtidssystem för att kunna ge förtroende för att det är möjligt att utföra en korrekt identifiering av fel(en) som orsakat körningsfel. Ett antal strategier utvärderades för loggval genom att injicera slumpmässiga fel i ett simulerat realtidssystem. Ett instrument konstruerades för att utföra en korrekt upptäckt och identifiering av dessa fel genom att utvärdera loggdata. Instrumentets utdata jämfördes med ett kontrollvärde för att bestämma riktigheten av instrumentet. Tre strategier skapades för att avgöra vilka loggposter som skulle behållas i det begränsade permanenta lagringsutrymmet. Strategierna utvärderades med hjälp av loggdata från det simulerade realtidssystemet. En av strategierna för val av loggdata presterade klart bättre än de andra två: den minimerade tiden för bearbetning och lagrade maximal mängd användbar loggdata i det permanenta lagringsutrymmet.

Network on Chip (NoC) architectures provide scalable platforms for designing Systems on Chip (SoC) with large number of cores. Developing products and applications using an NoC architecture offers many challenges and opportunities. A tool which can map an application or a set of applications to a given NoC architecture will be essential. In this thesis we first survey current techniques and we present our proposals for mapping and scheduling of concurrent applications to NoCs with multithreaded processors as computational resources. NoC platforms are basically a special class of Multiprocessor Embedded Systems (MPES). Conventional MPES architectures are mostly bus-based and, thus, are exposed to potential difficulties regarding scalability and reusability. There has been a lot of research on MPES development including work on mapping and scheduling of applications. Many of these results can also be applied to NoC platforms. Mapping and scheduling are known to be computationally hard problems. A large range of exact and approximate optimization algorithms have been proposed for solving these problems. The methods include Branch-and–Bound (BB), constructive and transformative heuristics such as List Scheduling (LS), Genetic Algorithms (GA) and various types of Mathematical Programming algorithms. Concurrent applications are able to capture a typical embedded system which is multifunctional. Concurrent applications can be executed on an NoC which provides a large computational power with multiple on-chip computational resources. Improving the time performances of concurrent applications which are running on Network on Chip (NoC) architectures is mainly correlated with the ability of mapping and scheduling methodologies to exploit the Thread Level Parallelism (TLP) of concurrent applications through the available NoC parallelism. Matching the architectural parallelism to the application concurrency for obtaining good performance-cost tradeoffs is  another aspect of the problem. Multithreading is a technique for hiding long latencies of memory accesses, through the overlapped execution of several threads. Recently, Multi-Threaded Processors (MTPs) have been designed providing the architectural infrastructure to concurrently execute multiple threads at hardware level which, usually, results in a very low context switching overhead. Simultaneous Multi-Threaded Processors (SMTPs) are superscalar processor architectures which adaptively exploit the coarse grain and the fine grain parallelism of applications, by simultaneously executing instructions from several thread contexts. In this thesis we make a case for using SMTPs and MTPs as NoC resources and show that such a multiprocessor architecture provides better time performances than an NoC with solely General-purpose Processors (GP). We have developed a methodology for task mapping and scheduling to an NoC with mixed SMTP, MTP and GP resources, which aims to maximize the time performance of concurrent applications and to satisfy their soft deadlines. The developed methodology was evaluated on many configurations of NoC-based platforms with SMTP, MTP and GP resources. The experimental results demonstrate that the use of SMTPs and MTPs in NoC platforms can significantly speed-up applications.

This thesis presents the I/O layer of Linux kernel and shows various tools for tuning and optimization of its performance. Many tools are presented and their usage and outputs are studied. The thesis then focuses on the means of combining such tools to create more applicable methodology of system analysis and monitoring. The practical part consists of applying SystemTap scripts for blktrace subsystem and creating a fragmentation monitoring tool with graphical output.