An ILP Formulation for the Task Graph Scheduling Problem Tailored to Bi-Dimensional Reconfigurable Architectures

This work proposes an exact ILP formulation for the task scheduling problem on a 2D dynamically and partially reconfigurable architecture. Our approach takes physical constraints of the target device that is relevant for reconfiguration into account. Specifically, we consider the limited number of reconfigurators, which are used to reconfigure the device. This work also proposes a reconfiguration-aware heuristic scheduler, which exploits configuration prefetching, module reuse, and antifragmentation techniques. We experimented with a system employing two reconfigurators. This work also extends the ILP formulation for a HW/SW Codesign scenario. A heuristic scheduler for this extension has been developed too. These systems can be easily implemented using standard FPGAs. Our approach is able to improve the schedule quality by 8.76% on average (22.22% in the best case). Furthermore, our heuristic scheduler obtains the optimal schedule length in 60% of the considered cases. Our extended analysis demonstrated that HW/SW codesign can indeed lead to significantly better results. Our experiments show that by using our proposed HW/SW codesign method, the schedule length of applications can be reduced by a factor of 2 in the best case

Scheduling and 2D placement heuristics for partially reconfigurable systems

This paper proposes new scheduling and 2D placement heuristics for partially dynamically reconfigurable systems. One specific focus of this work is to deal with applications containing hundreds of tasks grouped in a few number of task types. Such a task graph structure is representative of data intensive high performance applications. We present three variations to our task management method that correspond to three possible system scenarios: (i) possessing complete static knowledge of task sequences, (ii) only having information on the maximum resource requirement by any task expected to be executed, and (iii) having no prior knowledge of any kind about the workload. Each variant of our scheduler addresses an architecture that best matches the needs of a particular configuration of the system. Together they form a complete set of techniques to serve partial dynamic reconfiguration of massively parallel computing systems

Evaluation of the relationship between emotional and behavioral problems and quality of life of adolescents in school

Bilgin, sonay/0000-0003-2229-3820WOS: 000502486800001PubMed: 31835908This study was conducted to determine the quality of life and difficulties of adolescents in school age. This descriptive study was conducted in a city center three secondary School. Similarly from each school 114,114,116 people participated in the study, 4 students could not be included in the study due to insufficient data and the study was completed with 344 students. Questionnaire developed by the researcher, the Strengths and Difficulties Questionnaire (SDQ), and the Pediatric Quality of Life Inventory (PedsQL) were used for data collection. Research was completed in line with the ethical principles. According to the evaluations, it was observed that 50.6% of the students was 13 years old, 52% was male, and 53.5% was in the seventh grade. The total score average for PedsQL was 81.58 +/- 13.65, and the mean total score for SDQ was 25.02 +/- 4.813. A positive and significant correlation was found between "behavioral problems" subscale score of the SDQ and all subscales of PedsQL except the "physical health" subscale as well as the positive and significant correlation between the mean total scores of PedsQL and SDQ. It was observed that the quality of life of the students is affected negatively as the difficulties experienced during adolescence increase. Some recommendations were made to reveal the problems experienced by school-age adolescents and to increase their quality of life