intentions to drop out of high school, which are later implemented, leading to actual dropout behavior. This model was tested with high school students (N = 4,537) by means of a prospective design. Results from analyses of variance and a structural equation modeling analysis (with L1SREL) were found

The goal of this dissertation is to extend the Pfair scheduling approach in order to enable its efficient implementation on a real-time multiprocessor. At present, Pfair scheduling is the only known means for optimally scheduling recurrent real-time tasks on multiprocessors. In addition, there has

In this paper we consider the problem of allocating independent heterogeneous tasks on grid environment in which A new batching heuristic scheduling algorithm with Taking index parameters will be presented. Reference to tasks compute scheduling, several methods are evaluated. With compare Minmean

the machine that finishes first. While task replication reduces response time, it usually increases resource usage. In this work, we propose a theoretical framework to analyze the trade-off between response time and resource usage. We show that, while in general, there is a tension between response time

dynamic properties of their surroundings in a time sensitive manner. Such systems suffer bandwidth, energy, and throughput constraints that limit the quantity of information transferred from end-to-end. These factors coupled with unpredictable traffic patterns and dynamic network topologies make the task

dynamic properties of their surroundings in a time sensitive manner. Such systems suffer bandwidth, energy, and throughput constraints that limit the quantity of information transferred from end-to-end. These factors coupled with unpredictable traffic patterns and dynamic network topologies make the task

The richest sources of parallelism are loops with independent iterations. These iterations can be distributed to different processors, thus significantly decreasing execution time. However, in such situations, we may meet the imbalance problem, which means that some of the processors finish

length effect should be eliminated under these conditions: Long words, by definition, are associated with longer presentation durations. This means that one would expect the word length effect to disappear in the absence of rehearsal only when the total presentation time has been equated for short

Railway Scheduling is considered to be a difficult and time-consuming task. This is due to real railway networks can be modelled as Constraint Satisfaction Problems (CSPs), but they require a huge number of variables and constraints. The general CSP is known to be NP-complete; however, distributed

Abstract not found