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 ...

Taskgraphs model a broad range of parallel applications. Despite static scheduling, processor failures can be overcome with the help of task duplication, which we explored in a previous proposal. With the advent of processor frequency scaling, energy can be saved by the runtime system as it is informed about gaps in the schedule and task dependencies, and thus can slow down processors as long a...

The main objective of task scheduling is to assign tasks onto available processors with the aim of producing minimum schedule length and without violating the precedence constraints. Several algorithms have been proposed for solving task-scheduling problem. The most of them doesn't take into account the average communication of parents and data ready time. In this paper, a new static scheduling...

This is the first year IR group of Tsinghua University (THUIR) participates in NTCIR. We register the INTENT task and focus on the Chinese topics of subtopic mining and document ranking subtask. In our experiments, we try to mine subtopics from different resources, namely query recommendation, Wikipedia and the query-URL bipartite graph which is constructed by clickthrough data. We also develop...

Current workflow management systems (WFMS) require user to provide explicit process models. The design of model is a difficult, costly and error-prone task. This presents a practical barrier to the adoption of workflow management technologies. A possible solution is process mining which can distill workflow models from a set of real executions. However, the present research in process mining st...

Code duplication is considered as bad practice that complicates the maintenance and evolution of software. Detecting duplicated code is a difficult task because of the large amount of data to be checked and the fact that a priori it is unknown which code part has been duplicated. In this paper, we present a tool called DUPLOC that supports code duplication detection in a visual and exploratory ...

Cloud computing came into being and is currently an essential infrastructure of many commerce facilities. To achieve the promising potentials of cloud computing, effective and efficient scheduling algorithms are fundamentally important. However, conventional scheduling methodology encounters a number of challenges. During the tasks scheduling in cloud systems, how to make full use of resources ...

For task clustering with no duplication, the DSC algorithm of Gerasoulis and Yang is empirically the best known algorithm to date in terms of both speed and solution quality. The DSC algorithm is based on the critical path method. In this paper, we present an algorithm called CASS-II for task clustering with no duplication which is competitive to DSC in terms of both speed and solution quality....

In this paper, we study the following theoretical scheduling problem: the tasks of a given application have to be statically distributed and executed on the heterogeneous servers of a multi-user system on a wide area, heterogeneous network, such as Internet. The application is divided into a set of communicating tasks that may be executed on at least one, and possibly several, servers. The proc...

A common assumption in the literature on mixed-model assembly line balancing is that a task that is common to multiple models must be assigned to a single station. In this paper, we relax this restriction, and allow a common task to be assigned to different stations for different models. We seek to minimize the sum of costs of the stations and the task duplication. We develop an optimal solutio...