In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted directed acyclic graph (DAG), also called a task graph or macrodataflow graph, to a set of homogeneous processors, with the objective of minimizing the completion time. We analyze 21 such algorithms and classify them into four groups. The first group includes algorithms that schedule the DAG to ...

This paper describes the I-Help peer help network, where helpers and helpees are paired according to the contents of their user models. Although originally designed for large groups, in this paper we suggest ways in which I-Help may be used in a small group, problem-based learning curriculum. The use of I-Help will be very different in this context: it is not expected to be necessary for all st...

Technology is evolving at a rapid pace and the traditional modes of course delivery in higher education are increasingly being examined and supplemented or replaced by online or e-learning strategies, platforms, and methods. Research has indicated that today’s multi-tasking college student desires flexibility both in scheduling and the delivery of course material. Based on these suppositions, o...

In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted directed acyclic graph (DAG), also called a task graph or macro-dataflow graph, to a set of homogeneous processors, with the objective of minimizing the completion time. We analyze 21 such algorithms and classify them into four groups. The first group includes algorithms that schedule the DAG to...

In Desktop Grid, volunteers (i.e, resource providers) have heterogeneous properties and dynamically join and leave during execution. Moreover, some volunteers may behave erratically or maliciously. Thus, it is important to detect and tolerate erroneous results (i.e., result certification) in order to guarantee reliable execution, considering volatility and heterogeneity in a scheduling procedur...

Due to the recent proliferation of digital broadcasting, various schemes for broadcasting continuous media data have been studied. In general broadcasting systems, since data is broadcast repetitively, clients have to wait until their desired data is broadcast. These schemes reduce this waiting time by dividing the data into several segments of equal size. However, data often have appropriate d...

In 2003, Hamilton Health Sciences embarked on an initiative to improve and standardize nursing schedules and scheduling practices. The scheduling project was one of several initiatives undertaken by a corporate-wide Nursing Resource Group established to enhance the work environment and patient care and to ensure appropriate utilization of nursing resources across the organization's five hospita...

© 2009 Seung Hwan Lee et al. 481 This paper proposes a new multiuser scheduling algorithm that can simultaneously support a variety of different quality-of-service (QoS) user groups while satisfying fairness among users in the same QoS group in MIMO broadcast channels. Toward this goal, the proposed algorithm consists of two parts: a QoS-aware fair (QF) scheduling within a QoS group and an ante...

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...