Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 42 for “"Access Time"”.

  1. Reducing list access time for LISP execution

    … cache can either increase or decrease memory access time, depending on how well the prefetching algorithm matches the memory reference pattern. A popular prefetching algorithm is one block lookahead (OBL). Caches help to improve system performance mainly because of the localities that exist in …

    uiuc Repository record for Reducing list access time for LISP execution (opens in a new tab)

  2. Heuristics That Dynamically Alter Data Structures to Reduce Their Access Time

    Made available in DSpace on 2014-12-13T18:01:51Z (GMT). No. of bitstreams: 1 7708939.pdf: 3872478 bytes, checksum: a80e73c9fff2c75b1c2ec02567d176d9 (MD5) Previous issue date: 1976

    uiuc Repository record for Heuristics That Dynamically Alter Data Structures to Reduce Their Access Time (opens in a new tab)

  3. On-Disk Sequence Cache (ODSC): Using Excess Disk Capacity to Increase Performance

    … drive must do. As a result, the average disk access time is reduced. Reducing the disk access time improves the performance of the system, especially when booting the operating system, loading applications, and when main memory is limited. Experiments show that our ODSC speeds up application …

    byu Repository record for On-Disk Sequence Cache (ODSC): Using Excess Disk Capacity to Increase Performance (opens in a new tab)

  4. Innovation incentives and competition in the hard disk drive industry

    … is that the willingness to pay for faster access time to data may be initially low but increases over time. The firms' decisions to introduce faster access time are partly motivated by dynamic considerations.

    mit Repository record for Innovation incentives and competition in the hard disk drive industry (opens in a new tab)

  5. Enhanced Collision Resolution for the IEEE 802.11 Distributed Coordination Function

    … Function (DCF) as the fundamental medium access control method. DCF uses the Binary Exponential Backoff (BEB) algorithm to regulate channel access. The backoff period determined by BEB depends on a contention window (CW) whose size is doubled if a station suffers a collision and reset to …

    de-montfort Repository record for Enhanced Collision Resolution for the IEEE 802.11 Distributed Coordination Function (opens in a new tab)

  6. Reconfigurable Satellite Constellations for Mobile Target Tracking

    … different objectives throughout its mission lifetime, offering a more responsive, adaptable alternative to traditional Earth-observing satellite constellations. In the ReCon concept of operations, the constellation is nominally positioned to obtain global coverage. If an event of interest occurs …

    mit Repository record for Reconfigurable Satellite Constellations for Mobile Target Tracking (opens in a new tab)

  7. Switched capacitor, self referencing sensing scheme for high density magneto-resistive memories

    … dummy elements are balanced to have identical time constants, a two stage switched capacitor auto-zero scheme where the DC offsets between the two elements due to mismatch is removed while generating very little noise and self referencing which is done by a sample and compare circuit. This self …

    iastate Repository record for Switched capacitor, self referencing sensing scheme for high density magneto-resistive memories (opens in a new tab)

  8. Reducing memory access delays in large-scale shared-memory multiprocessors

    Memory access time is a key factor limiting the performance of large-scale, shared-memory multiprocessors. In such systems, limited bandwidth in the interconnection between the processors and the memories, coupled with long delays resulting from network and memory conflicts, can produce serious …

    uiuc Repository record for Reducing memory access delays in large-scale shared-memory multiprocessors (opens in a new tab)

  9. Scalable primary cache memory architectures

    … become prevalent, achieving low average memory access time by simply scaling existing designs becomes more difficult because of process limitations. This research shows that scaling an existing design by either keeping the latency of various structures constant or allowing the latency to vary …

    texas Repository record for Scalable primary cache memory architectures (opens in a new tab)

  10. Disk I/O in High-Performance Computing Systems

    … With such a bottleneck, a program's execution time on these systems could approach the associated file access time in the limiting case. We review the evolution of I/O architectures and characterize the access patterns of requests to those I/O systems. We apply this information to investigate …

    uiuc Repository record for Disk I/O in High-Performance Computing Systems (opens in a new tab)

  11. Design and analysis of privacy-preserving protocols

    … using the Internet to provide an easy way to get access to instant information. The equipment enabling these interactions is also storing information such as: access time, where you are, and what you plan to do. The ability to store this information is very convenient but is also the source of a …

    vu-aus Repository record for Design and analysis of privacy-preserving protocols (opens in a new tab)

  12. Scheduling policies for disks and disk arrays

    … less than 10% improvement annually in the random access time to small data blocks on the disk. Such accesses are very common in OLTP applications, which tend to have stringent response time requirements. Scheduling of disk requests is intended to improve their response time, reduce disk service …

    njit Repository record for Scheduling policies for disks and disk arrays (opens in a new tab)

  13. Compiler Memory Management and Compound Function Definition for Multiprocessors

    … architecture to reduce the program's memory access time. The compiler/architecture techniques this thesis examines are allocating data to faster local memories, using a pipelined interconnection network, and overlapping global memory access with other operations. We present data from …

    uiuc Repository record for Compiler Memory Management and Compound Function Definition for Multiprocessors (opens in a new tab)

  14. Improving disk read performance through block-level replication into free space

    Disk performance for random access fares significantly worse compared to sequential access. Time required to transfer random blocks to or from disk is dominated by seeking and rotational delay. To improve the throughput and reduce the latency, one can apply techniques to increase the sequentiality …

    ubc Repository record for Improving disk read performance through block-level replication into free space (opens in a new tab)

  15. Scalable Parameter Management using Casebased Reasoning for Cognitive Radio Applications

    … systems become more complex and more tightly time constrained, scalability becomes an apparent concern to store large amounts of information over multiple dimensions. This thesis presents a renewed look at an abstract application of CBR to CR. By appropriately designing a case structure with …

    vt Repository record for Scalable Parameter Management using Casebased Reasoning for Cognitive Radio Applications (opens in a new tab)

  16. Memory Module Design for High-Temperature Applications in SiC CMOS Technology

    … electronics. </p> <p>A novel static random-access memory (SRAM) cell is designed and implemented in a SiC 1 µm triple well CMOS process for high-temperature applications in this work. The prevalent issues encountered during SiC fabrication and the uncertainties in device performance led to …

    arkansas Repository record for Memory Module Design for High-Temperature Applications in SiC CMOS Technology (opens in a new tab)

  17. Scalable multi-access flash store for Big Data analytics

    … high-performance, high-capacity, scalable random-access storage. It achieves high-throughput by sharing large numbers of flash chips across a low-latency, chip-to-chip backplane network managed by the flash controllers. The additional latency for remote data access via this network is negligible …

    mit Repository record for Scalable multi-access flash store for Big Data analytics (opens in a new tab)

  18. Distributed Ground Station Network for CubeSat Communications

    … receiver nodes for the purposes of increasing access time to the spacecraft, and thereby increasing the potential amount of data that can be transferred from orbit to the ground. The current trends in cubesat communications will be analyzed and an argument will be made in favor of transitioning …

    vt Repository record for Distributed Ground Station Network for CubeSat Communications (opens in a new tab)

  19. Page management in hybrid memory systems

    … page correlation to identify forthcoming memory accesses and commence swaps ahead of time. The page management techniques proposed by Prefetching effectively hide the overhead of data movement between memories. We evaluate our design with simulations across 17 benchmarks from three different …

    uiuc Repository record for Page management in hybrid memory systems (opens in a new tab)

Page 1 of 3