Su-Hui Chiang

Learn More
This paper addresses the question of whether more accurate requested runtimes can significantly improve high-performance priority backfill policies, for production workloads running on leading edge systems such as the 1500 Origin 2000 system at NCSA or the new Tera-GRID. This question has been studied previously for FCFS-backfill using a limited set of(More)
The performance potential of run-to-completion (RTC) parallel processor scheduling policies is investigated by examining whether (1) application execution rate characteristics such as <italic>average parallelism (avg)</italic> and <italic>processor working set (PWS)</italic> and/or (2) limited preemption can be used to improve the performance of these(More)
This thesis addresses the problem of synthesizing images of real scenes under three-dimensional transformations in viewpoint and appearance. It is demonstrated that a variety of three-dimensional scene transformations can be rendered on a video display device by applying simple transformations to a set of basis images of the scene. The virtue of these(More)
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and prove its correctness. Our strategy and its extension to narrowing are intended for the implementation of non-strict non-deterministic functional logic programming languages. Our strategy is based on a graph transformation , called bubbling, that(More)
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling policies for workloads that run on parallel computer systems. We formulate a hierarchical two-level objective that contains two goals commonly placed on parallel computer systems:(More)
Fairness is an important issue for parallel job scheduling policies, but has been ignored in most of previous studies. In this paper, we consider two different styles of job fairness: FCFS and EQ. Commonly used summary statistics are applied to different job measures to evaluate the fairness under a wide range of non-preemptive parallel job scheduling(More)
On parallel systems, jobs that request a large fraction of the maximum resources available on the system may incur poor wait time. This paper evaluates whether giving a reservation to every waiting job can improve large jobs without significantly degrading the performance of other jobs. Using a wide range of workloads, including more recent workloads than(More)