No abstract

This paper presents parallelization strategies for a tabu search algorithm for the task scheduling problem on heterogeneous processors under task precedence constraints. Parallelization relies exclusively on the decompostion of the solution space exploration. Four different parallel strategies are proposed and implemented on an asynchronous parallel machine under PVM: the master-slave model, with two different schemes for improved load balancing, and the single-program-multiple-data model, with single-token and multiple-token message passing schemes. The comparative analysis of these strategies shows that the tabu search approach for this problem is very suitable to the parallelization of the neighborhood search, with efficiency results almost always close to one for problems over a certain size.

Online education cannot continue to grow at the current pace while ignoring a crucial component of campus support, wellness for adult online learners. This paper brings awareness to the concept of wellness as an important student support service in adult online education. It includes a summarized review of relevant literature and identifies specific wellness concerns of adult online learners. The paper also provides examples of how three American higher education institutions are addressing the issue of wellness promotion in online learning. It identifies areas for improvement in current wellness initiatives and offers recommended strategies for supporting adult online learner wellness to professional organizations, institutions, instructors, and distance learners.

No abstract

It has been already demozstrated that cost-effective multiprocessor designs may be obtained by combining in the same architecture processors of diflerent speeds (heterogeneous architecture) so that the serial and critical portions of the application may benefit from a fast single processor. This paper presents a systematic way to build static heuristic scheduling algorithms for such environments. Several algorithms are proposed and their performance are compared through simulation. One of the proposed algorithms is shown to achieve substantial performance gains as the degree of heterogeneity of the architecture increases.