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 433 for “"lazy"”.
-
Lazy Transaction Execution Models
… First we present Quantum Databases - a lazy transaction processing system that defers the making of choices in transactions until an application or user forces the choice by observation. Conceptually, the database is in a quantum state - in one of many possible worlds, exactly which one …
-
Lazy Fault Recovery for Redundant MPI
Distributed Systems (DS) where multiple computers share a workload across a network, are used everywhere, from data intensive computations to storage and machine learning. DS provide a relatively cheap and efficient solution that allows stability with improved performance for computational …
-
Lazy Fault Detection for Redundant MPI
As the scale of supercomputers grows, it is becoming increasingly important for software to efficiently withstand hardware and software faults. Process replication is one resilience technique, but typical implementations require replicas to stay closely synchronized with each other. We propose …
-
Interoperation for Lazy and Eager Evaluation
… model of computation that resolves incompatible lazy and eager eval- uation strategies using dual notions of evaluation contexts and values to mirror the lazy evaluation strategy in the eager one. This method could be extended to resolve incompatible evaluation strategies for any pair of …
-
Lazy release consistency for distributed shared memory
… can consequently achieve higher performance. The lazy release consistent protocols achieve this reduction in communication by piggybacking consistency information on top of existing synchronization transfers. Some of the protocols also improve performance by speculatively moving data. We evaluate …
-
Algorithmic debugging for complex lazy functional programs
… results. Existing algorithmic debuggers for a lazy functional language work well for small simple programs but cannot be used to locate defects in complex programs for two reasons: Firstly, to collect the information required for algorithmic debugging existing debuggers use different but …
-
Eager, Lazy, and Other Executions for Predicative Programming
… orders in use. One such order in common use is lazy execution or lazy evaluation, which is mostly demand-driven. Laziness supports better decompositions of algorithms, e.g., into modular producers and consumers, which enables compositional reasoning of answer correctness, but then timing …
-
Concurrent Lazy Splay Tree with Relativistic Programming Approach
… root of the tree in concurrent environment. The Lazy splaying is to rotate the tree at most one per access so that very frequently accessed item does full splaying. We present the RCU (Read-copy-update) based synchronization mechanism for splay tree operations which allows reads to occur …
-
Lazy Preservation: Reconstructing Websites from the Web Infrastructure
… this dissertation introduces the concept of lazy preservation{ digital preservation performed as a result of the normal operations of the Web Infrastructure (web archives, search engines and caches). First, the Web Infrastructure (WI) is characterized by its preservation capacity and …
-
How Lazy are the tRNAs on the Ribosome?
In this work the phosphorothioate technique is applied that allows a precise assessment of the accessibility of each individual phosphate group within RNA. The measurements were preformed with deacylated tRNAs bound to the ribosomal P site under various buffer conditions, and with a tRNA in …
-
Database State Manipulation in Lazy Functional Programming Languages
本文データは平成22年度国立国会図書館の学位論文(博士)のデジタル化実施により作成された画像ファイルを基にpdf変換したものである
-
Selectable Heaps and Their Application to Lazy Search Trees
… is necessary. We then apply the result to the lazy search trees of Sandlund & Wild, creating a new interval data structure based on selectable heaps. This gives optimal O(B+n) lazy search tree performance, lowering insertion complexity into a gap Δi to O(log(n/|Δi|))$ time. An O(1)-time merge …
-
LAIO: Lazy asynchronous I/O for event-driven servers
In this thesis, I introduce Lazy Asynchronous I/O (LAIO), a new API for performing I/O that is well-suited but not limited to the needs of high-performance, event-driven servers. In addition, I describe and evaluate an implementation of LAIO that demonstrably addresses certain critical limitations …
-
A lazy text-based approach to foundational knowledge acquisition.
… to fill those gaps. The method presented, called Lazy KA, uses examples (short NL stories) and failures of an explanation mechanism such as EBL to find these gaps and to interactively and incrementally learn the required new knowledge. When the explanation of a particular example fails, the user …
-
Fresh Techniques for Memory Profiling of Lazy Functional Programs
Lazy functional languages are known for their semantic elegance. They liberate programmers from many difficult responsibilities, such as the operational details of computations including memory management. However, the productivity and elegant semantics provided by lazy functional languages do not …
-
A lazy directory-based implementation of consistent replicated storage
Recent work in replicated datastores has focused on making availability and low latency the primary requirements. We present two directory-based data- stores which make strong application semantics a primary requirement based on ideas from cache coherence in multiprocessors and distributed shared …
Page 1 of 22