Burnout and work engagement among teachers: an application of the job demands-resources model

The present dissertation focuses on burnout and work engagement among teachers, with especial focus on the Job-Demands Resources Model: Chapter 1 focuses on teacher burnout. It aims to investigate the role of efficacy beliefs using negatively worded inefficacy items instead of positive ones and to establish whether depersonalization and cynism can be considered two different dimensions of the teacher burnout syndrome. Chapter 2 investigates the factorial validity of the instruments used to measure work engagement (i.e. Utrecht Work Engagement Scale, UWES-17 and UWES-9). Moreover, because the current study is partly longitudinal in nature, also the stability across time of engagement can be investigated. Finally, based on cluster-analyses, two groups that differ in levels of engagement are compared as far as their job- and personal resources (i.e. possibilities for personal development, work-life balance, and self-efficacy), positive organizational attitudes and behaviours (i.e., job satisfaction and organizational citizenship behaviour) and perceived health are concerned. Chapter 3 tests the JD-R model in a longitudinal way, by integrating also the role of personal resources (i.e. self-efficacy). This chapter seeks answers to questions on what are the most important job demands, job and personal resources contributing to discriminate burned-out teachers from non-burned-out teachers, as well as engaged teachers from non-engaged teachers. Chapter 4 uses a diary study to extend knowledge about the dynamic nature of the JD-R model by considering between- and within-person variations with regard to both motivational and health impairment processes.

Constraint Programming-based Job Dispatching for Modern HPC Applications

A High-Performance Computing job dispatcher is a critical software that assigns the finite computing resources to submitted jobs. This resource assignment over time is known as the on-line job dispatching problem in HPC systems. The fact the problem is on-line means that solutions must be computed in real-time, and their required time cannot exceed some threshold to do not affect the normal system functioning. In addition, a job dispatcher must deal with a lot of uncertainty: submission times, the number of requested resources, and duration of jobs. Heuristic-based techniques have been broadly used in HPC systems, at the cost of achieving (sub-)optimal solutions in a short time. However, the scheduling and resource allocation components are separated, thus generates a decoupled decision that may cause a performance loss. Optimization-based techniques are less used for this problem, although they can significantly improve the performance of HPC systems at the expense of higher computation time. Nowadays, HPC systems are being used for modern applications, such as big data analytics and predictive model building, that employ, in general, many short jobs. However, this information is unknown at dispatching time, and job dispatchers need to process large numbers of them quickly while ensuring high Quality-of-Service (QoS) levels. Constraint Programming (CP) has been shown to be an effective approach to tackle job dispatching problems. However, state-of-the-art CP-based job dispatchers are unable to satisfy the challenges of on-line dispatching, such as generate dispatching decisions in a brief period and integrate current and past information of the housing system. Given the previous reasons, we propose CP-based dispatchers that are more suitable for HPC systems running modern applications, generating on-line dispatching decisions in a proper time and are able to make effective use of job duration predictions to improve QoS levels, especially for workloads dominated by short jobs.