Scheduling large task graphs is an important issue in parallel computing since it allows the treatment of big size problems. In this paper we tackle the following problem: how to schedule a task graph, when it is too large to fit into memory? Our answer features the parameterized task graph (PTG), which is a symbolic representation of the task graph. We propose a dynamic scheduling algorithmwhi...

Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for task graph execution on distributed memory machines. Such an approach cannot be adapted to changes in values of program parameters and the number of processors and also it cannot handle large task graphs. In this pape...

Models of graph-based reasoning have typically accounted for the variation in problem solving performance with different graph types in terms of a task analysis of the problem relative to the particular visual properties of each graph type (e.g. Lohse, 1993; Peebles, Cheng & Shadbolt 1999, submitted). This approach has been used to explain response time and accuracy differences in experimental ...

let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...

one of the major criticisms leveled at task-based language teaching (tblt), despite its countless merits, is developing fluency at the cost of accuracy. the post-task stage affords a number of options to counteract this downside through task repetition and task recycling. these two options are considered to positively affect learners' oral performance in terms of fluency, accuracy, and complexi...

{ An important problem in parallel computing is to embed a task interaction graph into a static network. Dynamic embedding is performed at run-time, where the task interaction graph is not known in advance. In this paper, we investigate the performance of randomized embedding of tree-structured parallel computations (i.e., where the task interaction graph is a tree) into the classic hypercubic ...

Ring structures in molecules belong to the most important substructures for many applications in Computational Chemistry. One typical task is to find an implicit description of the ring structure of a molecule. We present efficient algorithms for cyclic graph invariants that may serve as molecular descriptors to accelerate database searches. Another task is to construct a well-defined set of ri...

Signal salience was manipulated using configural and object displays to examine their effects on the performance, workload, and stress of vigilance. Improving performance and reducing the workload and stress of vigilance are crucial concerns. Signal salience improves performance and reduces stress, but to date there have been no salience manipulations using configural displays in a vigilance ta...

Authorisation I hereby declare that I am the sole author of the thesis. I authorise the Hong Kong University of Science and Technology to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorise the Hong Kong University of Science and Technology to reproduce the thesis by photocopying or by other means, in total or in part, at the request ...