Browse by Title

• (2011-08-26)
With the emergence of highly multithreaded architectures, an effective performance monitoring system must reflect the interaction between a large number of concurrent events, and associate the overall effect of individual ...

application/pdf

PDF (1Mb)
• ([Urbana, Ill.] : College of Commerce and Business Administration, University of Illinois at Urbana-Champaign,, Aug 22 197)

application/pdf

PDF (1Mb)
• (2005-06)
In this paper, we develop a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries in OLAP. Such queries provide the k groups with the highest aggregates to decision makers. Essential ...

application/pdf

PDF (239Kb)
• (1992)
Antimicrotubule agents, colchicine, amiprophos-methyl (APM), pronamide, oryzalin and trifluralin were used to induce chromosome doubling of maize anther-derived haploid callus before plant regeneration. Without treatment ...

application/pdf

PDF (5Mb)
• (1991)
Three different propagation methods, including single-node cuttings, budded cuttings and tissue culture, were used to produce miniature roses. Subsequently, the efficiency of propagation and the vigor and quality of potted ...

application/pdf

PDF (4Mb)
• (2012-05-22)
Over a century after the modern prediction of the existence of individual particles of light by Albert Einstein, a reliable source of this simple quantum state of one photon does not exist. While common light sources such ...

application/pdf

PDF (4Mb)
• (1989)
Representations of meromorphic functions as quotients of analytic functions have been studied for years. Miles showed that any meromorphic function f can be written as f$\sb1$/f$\sb2$ where each f$\sb{\rm j}$ is entire and ...

application/pdf

PDF (3Mb)
• (1970)

application/pdf

PDF (817Kb)
• (Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 1966-03)

application/pdf

PDF (45Mb)
• (1999)
In this thesis work, performance factors for parallel I/O on clusters are examined and several algorithms are designed to support parallel I/O efficiently for scientific applications running on commodity clusters, making ...

application/pdf

PDF (4Mb)
• (1995)
Considerable research has produced a plethora of efficient methods of exploiting parallelism on dedicated machines. On typical real systems, however, some of the important assumptions that lead to efficiency on a dedicated ...

application/pdf

PDF (4Mb)
• ([Urbana] : College of Commerce and Business Administration, Bureau of Economic and Business Research, University of Illinois, Urbana-Champaign,, June 1981)

application/pdf

PDF (1Mb)
• (2011-08-26)
This thesis briefly reviews the important methods involved in solving the best design selection problem in the discrete-event system simulation. The selection of one or several best designs is a common problem people meet ...

application/pdf

PDF (780Kb)
• (2007)
The experimental results motivate the design of new coarsening algorithms to improve the performance of coarse-grid selection itself. A new algorithm labeled Bucket Sorted Independent Sets (BSIS) is developed and contributes ...

application/pdf

PDF (4Mb)
• (2007-05)
Solving partial differential equations (PDEs) using analytical techniques is intractable for all but the simplest problems. Many computational approaches to approximate solutions to PDEs yield large systems of linear ...

application/pdf

PDF (4Mb)
• (2013-05-17)
We present different methods to achieve max/min fairness in distributed systems. Max/Min fairness allows full utilization of resource capacities as long as there is demand for them. The capacity unused by some sources ...

application/pdf

PDF (251Kb)
• (2008)
In the end, this dissertation proposes an interesting future work, which is to find a set of variables protecting which it can most likely catch harmful errors that would cause Silent Data Corruption to the program. By ...

application/pdf

PDF (2Mb)
• (2008-07)

application/pdf

PDF (900Kb)
• (2008-07)
As semiconductor technology scales into the deep submicron regime the occurrence of transient or soft errors will increase. This will require new approaches to error detection. Software checking approaches are attractive ...

application/pdf

PDF (900Kb)
• (1993)
We present a new Chebyshev-Arnoldi algorithm for finding the lowest energy eigen-functions of an elliptic operator. The algorithm, which is essentially the same for symmetric, nonsymmetric, and complex nonhermitian matrices, ...

application/pdf

PDF (4Mb)