Browse by Subject "Computer Science"

  • Kim, Jae H. (1997)
    Based on the lessons learned from the study of ALU-biasing arbitration, we present a novel, cost-effective queueing and scheduling algorithm, called Rotating Combined Queueing (RCQ), which can efficiently support a range ...

    application/pdf

    application/pdfPDF (11MB)Restricted to U of Illinois
  • Cook, Diane Joyce (1990)
    This thesis addresses the problem of efficiently selecting base cases for problem-solving analogies. The base selection task is one of the most severe limitations in current analogical reasoning systems, because of the ...

    application/pdf

    application/pdfPDF (7MB)Restricted to U of Illinois
  • Gainaru, Ana (2014-05)
    A large percentage of computing capacity in todays large high-performance computing systems is wasted due to failures and recoveries. The fear in our community is that future Exascale systems will fail so frequently that ...

    application/pdf

    application/pdfPDF (486kB)
  • Pan, Hao (2001)
    Finally, kernel canonical correlation analysis (CCA) is developed to model nonlinear or high-order correlations between signals from two sources. Kernel CCA uses kernel principal component analysis (PCA), which elegantly ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Tsai, Timothy K. (1996)
    This thesis presents a benchmark for evaluating fault tolerance. The benchmark is based on the FTAPE tool, which injects CPU, memory, and disk faults and generates workloads with specifiable amounts of CPU, memory, and ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Park, Young-Tack (1993)
    The scheduler is an key component of a blackboard system architecture. This thesis addressed the important problem of how to make the blackboard scheduler more knowledge intensive in a way that facilitates the acquisition, ...

    application/pdf

    application/pdfPDF (7MB)Restricted to U of Illinois
  • Sohi, Gurindar Singh (1985)
    Due to the increasing popularity of nonnumeric processing languages such as LISP, there has been an increasing demand for machine architectures which are ideally suited to run such languages. Access to the main data structure ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Bodapati, Srinivas (2003)
    High-level power-grid design and analysis requires a current macro-model for different logic blocks that are both easy to use and automatically constructed. The main contribution of this research is the development of ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Lee, Daeshik (1991)
    An efficient method has been developed for the fast solution of the boundary problems of Poisson's equation on irregular as well as regular domains. The method, called the boundary method-based domain decomposition or BMDD, ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Daly, David M. (2005)
    Markovian modeling of systems is a promising technique used to gauge the performance, dependability, and performability of systems. It can be used to aid design decisions by evaluating a range of design options for a range ...

    application/pdf

    application/pdfPDF (7MB)Restricted to U of Illinois
  • Dankel, Douglas Duane, II (1980)
    Consider the tasks of trying to find similarities between the causes of the crashes of several aircraft of a common type, the causes or early warning signs for various diseases, the characteristics of stocks with high ...

    application/pdf

    application/pdfPDF (10MB)Restricted to U of Illinois
  • David, Francis M. (2009-01)
    Despite many decades of research, the management of errors in a live operating system remains a challenging problem. This thesis presents CuriOS, an operating system that incorporates several new error management techniques ...

    application/pdf

    application/pdfPDF (539kB)
  • David, Francis Manoj (2008)
    Fault injection experiments show that it is possible to recover from 87% or more manifested errors in operating system services such as the file system, timer, scheduler and network while maintaining low performance overheads.

    application/pdf

    application/pdfPDF (2MB)Restricted to U of Illinois
  • Liang, Jin (2007)
    MON is not just an example application designed according to OCMA. It is a simple, scalable and lightweight tool we have built for managing service applications running in a wide area environment. MON facilitates the ...

    application/pdf

    application/pdfPDF (3MB)Restricted to U of Illinois
  • Natarajan, Swaminathan (1990)
    Programs for hard real-time systems have stringent timing requirements. Real-time programs are usually designed for the worst-case situation, which makes them inefficient. We argue that real-time programs should be more ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Shi, Shaw-Ben (1990)
    This thesis addresses the issue of ensuring user programs to be executed reliably by making use of the idle resources provided by the workstation environment. In particular, we examine how to replicate user programs so ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Ceze, Luis H. (2007)
    The second contribution of this thesis is architecture support and programming model for a data-centric approach to thread synchronization. In Data-Centric Synchronization (DCS), the programmer uses local reasoning to ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • application/pdf

    application/pdfPDF (2MB)Restricted to U of Illinois
  • Strauss, Karin (2007)
    In this work, we propose to logically embed a ring in a point-to-point network topology. Snoop messages use the logical ring, while other messages can use any link in the network. The resulting design is simple and low ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Simonson, Jonathan (1996)
    Dependable real-time systems are essential to time-critical applications. The systems that run these applications require high degrees of performance and predictability. Although memory caching has long been known as a ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois