In many practical applications, multiple interrelated tasks must be accomplished in sequential order through user interactions with multiple retrieval, classification and recommendation systems. The ordering of the tasks may have a significant impact on the overall utility (or performance); hence optimal ordering of tasks is desirable. However, manual specification of near-optimal ordering is o...

The general purpose Finite Element system PERMAS [1] has been parallelized by a dynamic task graph approach capable to support shared and distributed parallel computer ar-chitectures as well as workstation clusters. The method used to parallelize this large application software package is of high generality and has the capability to parallelize all mathematical operations in a FEM analysis – no...

Consumer demand and improvements in hardware have caused distributed real-time embedded systems to rapidly increase in complexity. As a result, designers faced with timeto-market constraints are forced to rely on intelligent design tools to enable them to keep up with demand. These tools are continually being used earlier in the design process when the design is at higher levels of abstraction....

In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, originally developed for verification of real-time programs and digital circuits and more recently adapted for solving time-optimal scheduling problems. In this framework, the scheduling problem admits a state-space repr...

* Acknowledgments: This work was supported by DARPA under contract no. DAAB07-00-C-L516. ABSTRACT The increasing complexity of real-time embedded systems along with the short time-to-market for most of their applications have led designers to develop increasingly sophisticated algorithms and tools for system-level synthesis. At this level, coarse-grained tasks, such as discrete cosine transform...

The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompleteness of the problem has instigated researchers to propose a myriad of heuristic algorithms. While these algorithms are individually reported to be efficient, it is not clear how effective they are and how well they compa...

The inherently asynchronous nature of the data ow computation model allows the exploitation of maximum parallelism in program execution While this computational model holds great promise several problems must be solved in order to achieve a high degree of program performance The allocation and scheduling of programs on MIMD distributed memory parallel hardware is necessary for the implementatio...

this article reports on the findings of a study that investigated the impact of manipulating task performance conditions on listening task performance by learners of english as a foreign language (efl). the study was designed to explore the effects of changing complexity dimensions on listening task performance and to achieve two aims: to see how listening comprehension task performance was aff...

Whole slide image (WSI) has been widely used to assist automated diagnosis under the deep learning fields. However, most previous works only discuss SINGLE task setting which is not aligned with real clinical setting, where pathologists often conduct multiple tasks simultaneously. Also, it commonly recognized that multi-task paradigm can improve efficiency by exploiting commonalities and differ...