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 30 for “"File organization (Computer science)"”.
-
The Jade File System.
File systems have long been the most important and most widely used form of shared permanent storage. File systems in traditional time-sharing systems such as Unix support a coherent sharing model for multiple users. Distributed file systems implement this sharing model in local area networks. …
-
Accommodating individual differences in searching a hierarchical file system
… differences among users of a hierarchical file system were investigated. The results of a first experiment indicated that psychometric tests of vocabulary and spatial visualization were the best predictors of task performance, accounting for 45% of the variance in the data. The spatial …
-
Direct perfect hashing functions for external files
… (M.S.)--Michigan State University. Department of Computer Science, 1988
-
File migration in large distributed computer systems
File Migration (FM) is a tool for distributed file allocation, which is a subset of distributed resource management. FM is a method of dynamically allocating individual files, and copies of files, throughout the nodes of a distributed computer network. The purpose of a distributed file allocation …
-
File allocation in mobile distributed systems
Includes bibliographical references (pages 46-47).
-
Extreme scale data management in high performance computing
… employ at or during runtime. The accompanying BP file format is designed for high performance parallel output with limited coordination overheads while incorporating features to accelerate subsequent use of the output for reading operations. This pair of optimizations of the output mechanism and …
-
Data Replication Strategies in Cloud Computing
… it can be employed in large-scale distributed file systems to increase data availability and system reliability, or it can be used in many network models (e.g. data grid, Amazon CloudFront) to reduce access latency and network bandwidth consumption, etc. I study a series of problems that …
-
Interpolation search for alphabetic tables
<p>One of the fastest search techniques for uniformly distributed sorted numerical tables is interpolation search. This divide and conquer technique accesses the most probable key rather than the middle key as in binary search and continues to search similarly the appropriate part of the table . In …
-
Multi-disk subsystem organizations for very large databases
This thesis investigates efficient mappings of very large databases with non-uniform access to its data. to a. multi-disk subsystem. Two algorithms are developed to distribute the database across multiple disks, possibly with replication, in order to minimize latency and maximize throughput. These …
-
Adapting ACME to the database caching environment : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Information Systems at Massey University
The field of database cache replacement has seen a great many replacement policies presented in the past few years. As the challenge to find the optimal replacement policy continues, new methods and techniques of determining cache victims have been proposed, with some methods having a greater …
-
Attributes of fault-tolerant distributed file systems
Fault tolerance in distributed file systems will be investigated by analyzing recovery techniques and concepts implemented within the following models of distributed systems: pool-processor model and user-server model. The research presented provides an overview of fault tolerance characteristics …
Page 1 of 2