Dissertations / Theses on the topic 'Buffer storage (Computer science)'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Buffer storage (Computer science).'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
McNamee, Dylan James. "Virtual memory alternatives for transaction buffer management in a single-level store /." Thesis, Connect to this title online; UW restricted, 1996. http://hdl.handle.net/1773/6961.
Full textConnor, John. "The RIT IEEE-488 Buffer design /." Online version of thesis, 1992. http://hdl.handle.net/1850/11259.
Full textGhemawat, Sanjay. "The modified object buffer : a storage management technique for object-oriented databases." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/37012.
Full textIncludes bibliographical references (p. 113-117).
by Sanjay Ghemawat.
Ph.D.
Romer, Theodore H. "Using virtual memory to improve cache and TLB performance /." Thesis, Connect to this title online; UW restricted, 1998. http://hdl.handle.net/1773/6913.
Full textDong, Xiaomin. "D-Buffer : a new hidden-line algorithm in image-space /." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0035/MQ47446.pdf.
Full textRydberg, Ray Robert. "Gasping for harmony communication between arbitrary clock domains with multiple voltage domains using a locally-clocked, linear dual-clock FIFO scheme /." Pullman, Wash. : Washington State University, 2009. http://www.dissertations.wsu.edu/Dissertations/Spring2009/r_rydberg_042209.pdf.
Full textTitle from PDF title page (viewed on June 19, 2009). "School of Electrical Engineering and Computer Science." Includes bibliographical references (p. 117-125).
Rydberg, Ray Robert. "A gasp of fresh air a high speed distributed FIFO scheme for managing interconnect parasitics /." Online access for everyone, 2005. http://www.dissertations.wsu.edu/Thesis/Spring2005/R%5FRydberg%5F050505.pdf.
Full textCheng, Kin On. "A multi-stage optical switch with output buffer using WDM for delay lines sharing /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202003%20CHENG.
Full textIncludes bibliographical references (leaves 77-79). Also available in electronic version. Access restricted to campus users.
Torabkhani, Nima. "Modeling and analysis of the performance of networks in finite-buffer regime." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/51810.
Full textYe, Lei. "Energy Management for Virtual Machines." Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/283603.
Full textPrasad, Ravi S. "An evolutionary approach to improve end-to-end performance in TCP/IP networks." Diss., Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/22543.
Full textIn network paths with significant available bandwidth, increasing the TCP window till observing loss can result in much lower throughput than the path's available bandwidth. We show that changes in TCP are {em not required} to utilize all the available bandwidth, and propose the application-layer SOcket Buffer Auto-Sizing (SOBAS) mechanism to achieve this goal. SOBAS relies on run-time estimation of the round trip time (RTT) and receive rate, and limits its socket buffer size when the receive rate approaches the path's available bandwidth. In a congested network, SOBAS does not limit its socket buffer size. Our experiment results show that SOBAS improves TCP throughput in uncongested network without hurting TCP performance in congested networks.
Improper router buffer sizing can also result in poor TCP throughput. Previous research in router buffer sizing focused on network performance metrics such as link utilization or loss rate. Instead, we focus on the impact of buffer sizing on end-to-end TCP performance. We find that the router buffer size that optimizes TCP throughput is largely determined by the link's output to input capacity ratio. If that ratio is larger than one, the loss rate drops exponentially with the buffer size and the optimal buffer size is close to zero. Otherwise, if the output to input capacity ratio is lower than one, the loss rate follows a power-law reduction with the buffer size and significant buffering is needed. The amount of buffering required in this case depends on whether most flows end in the slow-start phase or in the congestion avoidance phase.
TCP throughput also depends on whether the cross-traffic reduces its send rate upon congestion. We define this cross-traffic property as {em congestion responsiveness}. Since the majority of Internet traffic uses TCP, which reduces its send rate upon congestion, an aggregate of many TCP flows is believed to be congestion responsive. Here, we show that the congestion responsiveness of aggregate traffic also depends on the flow arrival process. If the flow arrival process follows an open-loop model, then even if the traffic consists exclusively of TCP transfers, the aggregate traffic can still be unresponsive to congestion. TCP flows that arrive in the network in a closed-loop manner are always congestion responsive, on the other hand. We also propose a scheme to estimate the fraction of traffic that follows the closed-loop model in a given link, and give practical guidelines to increase that fraction with simple application-layer modifications.
Uppal, Amit. "Increasing the efficiency of network interface card." Master's thesis, Mississippi State : Mississippi State University, 2007. http://library.msstate.edu/etd/show.asp?etd=etd-10282007-162402.
Full textGrigorescu, Eduard. "Reducing internet latency for thin-stream applications over reliable transport with active queue management." Thesis, University of Aberdeen, 2018. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=236098.
Full textThuppal, Rajagopalan. "On pipelined multistage interconnection networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0002/MQ36185.pdf.
Full textYeo, Yong-Kee. "Dynamically Reconfigurable Optical Buffer and Multicast-Enabled Switch Fabric for Optical Packet Switching." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/14615.
Full textZhang, Peng Frank. "Jitter buffer management algorithms for voice communication." Thesis, University of Ottawa (Canada), 2002. http://hdl.handle.net/10393/6345.
Full textSchor, James E. (James Edward). "Efficient algorithms for buffer allocation." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/11458.
Full textIncludes bibliographical references (leaves 127-131).
by James E. Schor.
M.S.
Nagpal, Radhika. "Store Buffers : implementing single cycle store instructions in write-through, write-back and set associative caches." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/36678.
Full textIncludes bibliographical references (p. 87).
This thesis proposes a new mechanism, called Store Buffers, for implementing single cycle store instructions in a pipelined processor. Single cycle store instructions are difficult to implement because in most cases the tag check must be performed before the data can be written into the data cache. Store buffers allow a store instruction to read the cache tag as it. passes through the pipe while keeping the store instruction data buffered in a backup register until the data cache is free. This strategy guarantees single cycle store execution without increasing the hit access time or degrading the performance of the data cache for simple direct-mapped caches, as well as for more complex set associative and write-back caches. As larger caches are incorporated on-chip, the speed of store instructions becomes an increasingly important part of the overall performance. The first part of the thesis describes the design and implementation of store buffers in write through, write-back, direct-mapped and set associative caches. The second part describes the implementation and simulation of store buffers in a 6-stage pipeline with a direct mapped write-through pipelined cache. The performance of this method is compared to other cache write techniques. Preliminary results show that store buffers perform better than other store strategies under high IO latencies and cache thrashing. With as few as three buffers, they significantly reduce the number of cycles per instruction.
by Radhika Nagpal.
B.S.and M.S.
Dong, Chen. "Buffer-aided multihop wireless communications." Thesis, University of Southampton, 2014. https://eprints.soton.ac.uk/364737/.
Full textChen, Minjie Ph D. Massachusetts Institute of Technology. "Stacked switched capacitor energy buffer architecture." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/73699.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (p. 133-134).
Electrolytic capacitors are often used for energy buffering applications, including buffering between single-phase ac and dc. While these capacitors have high energy density compared to film and ceramic capacitors, their life is limited and their reliability is a major concern. This thesis presents a series of stacked switched capacitor (SSC) energy buffer architectures which overcome this limitation while achieving comparable effective energy density without electrolytic capacitors. The architectural approach is introduced along with design and control techniques which enable this energy buffer to interface with other circuits. A prototype SSC energy buffer using film capacitors, designed for a 320 V dc bus and able to support a 135 W load has been built and tested with a power factor correction circuit. This thesis starts with a detailed comparative study of electrolytic, film, and ceramic capacitors, then introduces the principles of SSC energy buffer architectures, and finally designs and explains the design methodologies of a prototype circuit. The experimental results successfully demonstrate the effectiveness of the approach.
by Minjie Chen.
S.M.
Liu, Yang. "Simulating depth of field using per-pixel linked list buffer." Thesis, Purdue University, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=1598036.
Full textIn this thesis, I present a method for simulating three characteristics of depth of field image: partial occlusion, bokeh and blur. Retrieving color from occluded surfaces is achieved by constructing a per-pixel linked list buffer, which only requires two render passes. Additionally, per-pixel linked list buffer eliminates the memory overhead of empty pixels in depth layers. Bokeh and blur effect are accomplished by image-space point splatting (Lee 2008). I demonstrate how point splatting can be used to account for the effect of aperture shape and intensity distribution on bokeh. Spherical aberration and chromatic aberration can be approximated using a custom pre-built sprite. Together as a package, this method is capable matching the realism of multi-perspective methods and layered methods.
Kim, Byungsub 1978. "An efficient buffer management methods for Cachet." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28720.
Full textIncludes bibliographical references (leaves 83-85).
(cont.) running simulation. Third, since BCachet is almost linear under the assumption of a reasonable number of sites, BCachet is very scalable. Therefore, it can be used to for very large scale multiprocessor systems.
We propose an efficient buffer management method for Cachet [7], called BCachet. Cachet is an adaptive cache coherence protocol based on a mechanism-oriented memory model called Commit-Reconcile & Fences (CRF) [1]. Although Cachet is theoretically proved to be sound and live, a direct implementation of Cachet is not feasible because it requires too expensive hardware. We greatly reduced the hardware cost for buffer management in BCachet without changing the memory model and the adaptive nature of Cachet. Hardware cost for the incoming message buffer of the memory site is greatly reduced from PxN FIFOs to two FIFOs in BCachet where P is the number of sites and N is the number of address lines in a memory unit. We also reduced the minimum size of suspended message buffer per memory site from (log₂ P+V) xPx(rq[max]), to log₂ P where V is the size of a memory block in terms of bits and rqma is the maximum number of request messages per cache. BCachet has three architectural merits. First, BCachet separates buffer management units for deadlock avoidance and those units for livelock avoidance so that a designer has an option in the liveness level and the corresponding hardware cost: (1) allows a livelock with an extremely low probability and saves hardware cost for fairness control. (2) does not allow a livelock at all and accept hardware cost for fairness control. Second, a designer can easily parameterize the sizes of buffer units to explore the cost-performance curves without affecting the soundness and the liveness. Because usual sizes of buffer management units are much larger than the minimum sizes of those units that guarantee the liveness and soundness of the system, a designer can easily find optimum trade-off point for those units by changing size parameters and
by Byungsub Kim.
S.M.
Gutierrez, Manuel S. M. Massachusetts Institute of Technology. "An energy buffer for constant power loads." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/111914.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 111-113).
Constant power loads (CPLs) are a class of loads steadily increasing in use. They are present whenever a load is regulated to maintain constant output power, such as with LED drivers in high quality lighting that is impervious to input fluctuations. Because CPLs exhibit a negative incremental input impedance, they pose stability concerns in DC and AC systems. This thesis presents a power converter for a constant power LED bulb that presents a favorable input impedance to the grid. The use of an energy buffer allows the converter to draw variable power in order to resemble a resistive load, while the output consumes constant power. A switched-mode power supply consisting of a cascaded boost and buck converter accomplishes this by storing energy in the boost stage output capacitor. Experimental results demonstrate that the converter exhibits a resistive input impedance at frequencies over 0.5 Hz while maintaining constant power to the LED load.
by Manuel Gutierrez.
S.M.
Nelson, Jude Christopher. "Wide-Area Software-Defined Storage." Thesis, Princeton University, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10824272.
Full textThe proliferation of commodity cloud services helps developers build wide-area "system-of-systems" applications by harnessing cloud storage, CDNs, and public datasets as reusable building blocks. But to do so, developers must contend with two long-term challenges. First, whenever developers change storage providers, they must work to preserve the application's expected storage semantics, i.e. the rules governing how the application expects the storage provider to handle its reads and writes. Today, changing storage providers is costly, because developers need to patch the application to make it compatible with the new provider's data consistency model, access controls, replica placement strategies, and so on. At the same time, users have certain expectations about how their data will be used, which the application must meet. For example, depending on the application, users may expect that their data will be kept private from other users, that their data will be exportable to other applications, that accesses to their data will be logged in an auditable way, and so on. In the limit, each user's expectations represent an implicit policy constraining how their data can be stored. Honoring these policies is difficult for developers who rely on third-party storage providers because the storage provider is often unaware of them. This thesis addresses these challenges with a new wide-area storage paradigm, called "software-defined storage" (SDS), that runs in-between applications and cloud services. SDS-enabled applications do not host data, but instead let users bring their preferred cloud services to the application. By taking a user-centric approach to hosting data, users are empowered to programmatically specify their policies independent of their applications and select services that will honor them. To support this approach and to tolerate service provider changes, SDS empowers developers to programmatically specify their application's storage semantics independent of storage providers. This thesis presents the design principles for SDS, and validates their real-world applicability with two SDS implementations and several non-trivial applications built on top of them. Most of these applications are used in production today. This thesis presents microbenchmarks of the SDS implementations and uses real-world experiences to show how to make the most of SDS.
Chung, Chanwoo S. M. Massachusetts Institute of Technology. "NOHOST : a new storage architecture for distributed storage systems." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/107295.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 53-55).
This thesis introduces a new NAND flash-based storage architecture, NOHOST, for distributed storage systems. A conventional flash-based storage system is composed of a number of high-performance x86 Xeon servers, and each server hosts 10 to 30 solid state drives (SSDs) that use NAND flash memory. This setup not only consumes considerable power due to the nature of Xeon processors, but it also occupies a huge physical space compared to small flash drives. By eliminating costly host servers, the suggested architecture uses NOHOST nodes instead, each of which is a low-power embedded system that forms a cluster of distributed key-value store. This is done by refactoring deep I/O layers in the current design so that refactored layers are light-weight enough to run seamlessly on resource constrained environments. The NOHOST node is a full-fledged storage node, composed of a distributed service frontend, key-value store engine, device driver, hardware flash translation layer, flash controller and NAND flash chips. To prove the concept of this idea, a prototype of two NOHOST nodes has been implemented on Xilinx Zynq ZC706 boards and custom flash boards in this work. NOHOST is expected to use half the power and one-third the physical space as compared to a Xeon-based system. NOHOST is expected to support the through of 2.8 GB/s which is comparable to contemporary storage architectures.
by Chanwoo Chung.
S.M.
Ku, Fei Yen. "Towards Automatic Initial Buffer Configuration." Thesis, University of Waterloo, 2003. http://hdl.handle.net/10012/1078.
Full textViking, Pontus. "Comparison of Dynamic Buffer Overflow Protection Tools." Thesis, Linköping University, Department of Computer and Information Science, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-6008.
Full textAs intrusion attacks on systems become more and more complex, the tools trying to stop these attacks must follow. This thesis has developed a testbed to test and evaluated three freely available protection tools for the GNU/Linux platform to see how they fare against attacks.
Miao, Yi. "M-Buffer, a practice of object-oriented computer graphics with UML." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0017/MQ55525.pdf.
Full textTarlescu, Maria-Dana. "The Elastic History Buffer, a multi-hybrid branch prediction scheme using static classification." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0025/MQ50893.pdf.
Full textZhivich, Michael A. "Detecting buffer overflows using testcase synthesis and code instrumentation." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/32112.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 143-146).
The research presented in this thesis aims to improve existing approaches to dynamic buffer overflow detection by developing a system that utilizes code instrumentation and adaptive test case synthesis to find buffer overflows and corresponding failure-inducing inputs automatically. An evaluation of seven modern dynamic buffer overflow detection tools determined that C Range Error Detector (CRED) is capable of providing fine-grained buffer access information necessary for the creation of this system. CRED was also selected because of its ability to provide comprehensive error reports and compile complex programs with reasonable performance overhead. CRED was extended to provide appropriate code instrumentation for the adaptive testing system, which also includes a test case synthesizer that uses data perturbation techniques on legal inputs to produce new test cases, and an analytical module that evaluates the effectiveness of these test cases. Using information provided by code instrumentation in further test case generation creates a feedback loop that enables a focused exploration of the input space and faster buffer overflow detection. Applying the adaptive testing system to jabberd, a Jabber Instant Messaging server, demonstrates its effectiveness in finding buffer overflows and its advantages over existing dynamic testing systems.
(cont.) Adaptive test case synthesis using CRED to provide buffer access information for feedback discovered 6 buffer overflows in jabberd using only 53 messages, while dynamic testing using random messages generated from a protocol description found only 4 overflows after sending 10,000 messages.
by Michael A. Zhivich.
M.Eng.
Boo, Hyun Ho. "Virtual ground reference buffer technique in switched-capacitor circuits." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99812.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 121-125).
The performance of switched-capacitor circuits depends highly on the op-amp specifications. In conventional designs, trade-offs in speed, noise, and settling accuracy make it difficult to implement power-efficient switched-capacitor circuits. The problem originates from the inverse relationship between the feedback factor and the signal gain. This thesis proposes the virtual ground reference buffer technique that enhances performance by improving the feedback factor of the op-amp without affecting signal gain. A key concept in the technique is the bootstrapping action of level-shifting buffers. It exploits op-amp-based circuits whose principles are very well understood and the design techniques are mature. The solution ultimately relaxes the required op-amp requirements including unity-gain bandwidth, noise, offset voltage and open-loop gain that would otherwise result in complex design and high power consumption. The concept is demonstrated in a 12-b 250MS/s pipelined ADC.
by Hyun Ho Boo.
Ph. D.
Koletka, Robert. "An architecture for secure searchable cloud storage." Master's thesis, University of Cape Town, 2012. http://hdl.handle.net/11427/12099.
Full textIncludes bibliographical references.
Cloud Computing is a relatively new and appealing concept; however, users may not fully trust Cloud Providers with their data and can be reluctant to store their files on Cloud Storage Services. The problem is that Cloud Providers allow users to store their information on the provider's infrastructure with compliance to their terms and conditions, however all security is handled by the provider and generally the details of how this is done are not disclosed. This thesis describes a solution that allows users to securely store data all a public cloud, while also providing a mechanism to allow for searchability through their encrypted data. Users are able to submit encrypted keyword queries and, through a symmetric searchable encryption scheme, the system retrieves a list of files with such keywords contained within the cloud storage medium.
Perumal, Sameshan. "Simulating raid storage systems for performance analysis." Master's thesis, University of Cape Town, 2007. http://hdl.handle.net/11427/6435.
Full textRedundant Array of Independent Disks (RAID) provides an inexpensive, fault-tolerant storage solution using commodity hard-drives. RAID storage systems have recently surged in popularity amongst enterprise clients, as they provide economical, scalable, high-performance solutions for their storage requirements. The performance of RAID systems is negatively affected by the overhead required to manage and access multiple drives, and multiple disk failures can result in data loss. As RAID has developed, various improvements have been devised by both academia and business to address these shortcomings. These improvements have suggested improved architectures to increase performance and new coding techniques to protect against data loss in the case of drive failure. Evaluating the effect on performance of these improvements is greatly simplified by the use of discrete-event, software simulations. The RAID Operations Simulator for Testing Implementations (RÖSTI) was developed to support such simulation experiments.
Strauss, Jacob A. (Jacob Alo) 1979. "Device-transparent personal storage." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/62459.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 83-87).
Users increasingly store data collections such as digital photographs on multiple personal devices, each of which typically presents the user with a storage management interface isolated from the contents of all other devices. The result is that collections easily become disorganized and drift out of sync. This thesis presents Eyo, a novel personal storage system that provides device transparency: a user can think in terms of "file X", rather than "file X on device Y", and will see the same set of files on all personal devices. Eyo allows a user to view and manage the entire collection of objects from any of their devices, even from disconnected devices and devices with too little storage to hold all the object content. Eyo separates metadata (application-specific attributes of objects) from the content of objects, allowing even storage-limited devices to store all metadata and thus provide device transparency. Fully replicated metadata allows any set of Eyo devices to efficiently synchronize updates. Applications can specify flexible placement rules to guide Eyo's partial replication of object contents across devices. Eyo's application interface provides first-class access to object version history. If multiple disconnected devices update an object concurrently, Eyo preserves each resulting divergent version of that object. Applications can then examine the history and either coalesce the conflicting versions without user direction, or incorporate these versions naturally into their existing user interfaces. Experiments using Eyo for storage in several example applications-media players, a photo editor, podcast manager, and an email interface-show that device transparency can be had with minor application changes, and within the storage and bandwidth capabilities of typical portable devices.
by Jacob Alo Strauss.
Ph.D.
Falk, Matthew D. "Cryptographic cloud storage framework." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/85417.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (page 59).
The cloud prevents cheap and convenient ways to create shared remote repositories. One concern when creating systems that provide security is if the system will be able to remain secure when new attacks are developed. As tools and techniques for breaking security systems advance, new ideas are required to provide the security guarantees that may have been exploited. This project presents a framework which can handle the ever growing need for new security defenses. This thesis describes the Key Derivation Module that I have constructed, including many new Key Derivation Functions, that is used in our system.
by Matthew D. Falk.
M. Eng.
Chen, An. "Buffer-efficient RTA algorithms in optical TDM networks /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?ECED%202007%20CHENA.
Full textBaroody, Ramzi. "Nested relations and object-orientation on secondary storage." Thesis, McGill University, 1993. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=69697.
Full textRELIX is a database progamming system based on the relational model. Inheritance and nesting are two important features which are desirable to have in a database. Therefore, our aim was to incorporate these features in RELIX. The implementation was done using RELIX's existing relational functionality, without any modification. Inheritance and nesting were implemented using the natural join, showing that they could be implemented using relational operations. New syntax was added to RELIX to enable the user to take advantage of inheritance and nesting, thus giving the programmer an object-oriented view on a relational database. We also took advantage of the dependence of inheritance and nesting on the natural join, and implemented an alternative algorithm for it based on the concept of a join index. This algorithm improves the performance of natural joins for low activity operations such as those associated with inheritance and nesting.
Zhao, Xiaoyan 1966. "Trie methods for structured data on secondary storage." Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=36855.
Full textWe apply the trie structures to indexing, storing and querying structured data on secondary storage. We are interested in the storage compactness, the I/O efficiency, the order-preserving properties, the general orthogonal range queries and the exact match queries for very large files and databases. We also apply the trie structures to relational joins (set operations).
We compare trie structures to various data structures on secondary storage: multipaging and grid files in the direct access method category, R-trees/R*-trees and X-trees in the logarithmic access cost category, as well as some representative join algorithms for performing join operations. Our results show that range queries by trie method are superior to these competitors in search cost when queries return more than a few records and are competitive to direct access methods for exact match queries. Furthermore, as the trie structure compresses data, it is the winner in terms of storage compared to all other methods mentioned above.
We also present a new tidy function for order-preserving key-to-address transformation. Our tidy function is easy to construct and cheaper in access time and storage cost compared to its closest competitor.
Johnston, Reece G. "Secure storage via information dispersal across network overlays." Thesis, The University of Alabama in Huntsville, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10157562.
Full textIn this paper, we describe a secure distributed storage model to be used especially with untrusted devices, most notably cloud storage devices. The model does so through a peer-to-peer overlay and storage protocol designed to run on existing networked systems. We utilize a structured overlay that is organized in a layered, hierarchical manner based on the underlying network structure. These layers are used as storage sites for pieces of data near the layer at which that data is needed. This data is generated and distributed via a technique called an information dispersal algorithm (IDA) which utilizes an erasure code such as Cauchy Reed-Solomon (RS). Through the use of this IDA, the data pieces are organized across neighboring layers to maximize locality and prevent a compromise within one layer from compromising the data of that layer. Speci?cally, for a single datum to become compromised, a minimum of two layers would have to become compromised. As a result, security, survivability, and availability of the data is improved compared to other distributed storage systems. We present signi?cant background in this area followed by an analysis of similar distributed storage systems. Then, an overview of our proposed model is given along with an in-depth analysis, including both experimental results and theoretical analysis. The recorded overhead (encoding/decoding times and associated data sizes) shows that such a scheme can be utilized with little increase in overall latency. Making the proposed model an ideal choice for any distributed storage needs.
Funck, Johan. "Distributed Database Storage Solution in Java." Thesis, Umeå University, Department of Computing Science, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-34185.
Full textCar sales companies have in the last couple of years discovered that there is a big market in storing their customer's summer and winter tires for a small fee. For the customers it is very convenient to get rid of the all known storage problem with season tires. Burlin Motor Umeå is one of these companies and they are offering seasonal storage and change of tires in autumn and spring as well as washing of tires.The main problem for this kind of storage is how to make the storage easy to overview and how to keep track of all tires. This paper is a report on a distributed storage solution in Java for summer and winter tires based on criteria from Burlin Motor Umeå.
McDonald, Eric Lawrence. "A video controller and distributed frame buffer for the J-machine." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/35021.
Full textIncludes bibliographical references (p. 201-202).
by Eric Lawrence McDonald.
M.S.
McNamara, Thomas William. "Nonvolatile hologram storage in BaTiO₃." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/40993.
Full textIncludes bibliographical references (p. 145-152).
by Thomas William McNamara.
Ph.D.
Seering, Adam B. "Efficient storage of versioned matrices." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/66705.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student submitted PDF version of thesis.
Includes bibliographical references (p. 95-96).
Versioned-matrix storage is increasingly important in scientific applications. Various computer-based scientific research, from astronomy observations to weather predictions to mechanical finite-element analyses, results in the generation of large matrices that must be stored and retrieved. Such matrices are often versioned; an initial matrix is stored, then a subsequent matrix based on the first is produced, then another subsequent matrix after that. For large databases of matrices, available disk storage can be a substantial constraint. I propose a framework and programming interface for storing such versioned matrices, and consider a variety of intra-matrix and inter-matrix approaches to data storage and compression, taking into account disk-space usage, performance for inserting data, and performance for retrieving data from the database. For inter-matrix "delta" compression, I explore and compare several differencing algorithms, and several means of selecting which arrays are differenced against each other, with the aim of optimizing both disk-space usage and insert and retrieve performance. This work shows that substantial disk-space savings and performance improvements can be achieved by judicious use of these techniques. In particular, a combination of Lempel-Ziv compression and a proposed form of delta compression, it is possible to both decrease disk usage by a factor of 10 and increase query performance for a factor of two or more, for particular data sets and query workloads. Various other strategies can dramatically improve query performance in particular edge cases; for example, a technique called "chunking", where a matrix is broken up and saved as several files on disk, can cause query runtime to be approximately linear in the amount of data requested rather than the size of the raw matrix on disk.
by Adam B. Seering.
M.Eng.
Chan, Wilson John. "The Alewife secondary storage subsystem." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/34095.
Full textIncludes bibliographical references (leaves 41-42).
by Wilson John Chan.
M.S.
Greco, Nicola S. M. Massachusetts Institute of Technology. "Decentralized infrastructure for file storage." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113976.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 99-103).
How might we incentivize a peer-to-peer network to store users' files? The purpose of this research is to combine ideas from existing peer-to-peer file sharing systems, blockchain technology and Proofs-of-Storage to create an incentivized decentralized storage network, where every participant can earn a reward for storing and serving files or pay the network to store or retrieve their own. More broadly, in this thesis we present the elementary components for building decentralized infrastructure, culminating in a protocol for incentivizing file storage.
by Nicola Greco.
S.M.
Marmol, Leonardo. "Customized Interfaces for Modern Storage Devices." FIU Digital Commons, 2017. http://digitalcommons.fiu.edu/etd/3165.
Full textLu, Kan. "Lattice-matched (In,Ga)P buffer layers for ZnSe based visible emitters." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/37509.
Full textBrasca, Claudio M. E. "5GHz CMOS resonant clock buffer with quadrature generation for fiber optic applications." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/30370.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (leaves 102-104).
Clock buffers constitute a major source of power dissipation in VLSI circuits. In CMOS the load is primarily capacitive and hence an inductive shunt can reduce real power needs. This almost-adiabatic topology is referred to as a resonant buffer. Two resonant buffers can be actively controlled by additional variable capacitance, to deliver quadrature signals from a single incoming clock. The cost of this quadrature generation is added complexity of control algorithm and the advantage is 85% less power than alternate methods. This topology is used to create quadrature signals and drive the clock inputs of a bang-bang half-rate phase detector in a 10GBit/sec Clock and Data Recovery Circuit. The 0.13um CMOS implementation shows significant power savings. A useful closed form expression for jitter transfer characteristic of generic linear-time-invariant filters is derived and applied to the proposed buffer to show it can be transparently integrated in existing CDR architectures. The work for this thesis was conducted in part at Analog Devices Inc.
by Claudio M.E. Brasca.
M.Eng.
Ankireddipally, L. R. "Formalization of storage considerations in software design." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=548.
Full textTitle from document title page. Document formatted into pages; contains vii, 110 p. : ill. Includes abstract. Includes bibliographical references (p. 95-97).
Sikalinda, Paul. "Analyzing Storage System Workloads." Thesis, University of Cape Town, 2006. http://pubs.cs.uct.ac.za/archive/00000410/.
Full text