You searched for subject:(File System).
Showing records 1 – 30 of
142 total matches.
◁ [1] [2] [3] [4] [5] ▶
Virginia Tech
1.
Sim, Hyogi.
AnalyzeThis: An Analysis Workflow-Aware Storage System.
Degree: MS, Computer Science, 2014, Virginia Tech
URL: http://hdl.handle.net/10919/76927 
► Supercomputing application simulations on hundreds of thousands of cores produce vast amounts of data that need to be analyzed on smaller-scale clusters to glean insights.…
(more)
▼ Supercomputing application simulations on hundreds of thousands of cores produce vast amounts of data that need to be analyzed on smaller-scale clusters to glean insights. The process is referred to as an end-to-end workflow. Extant workflow systems are stymied by the storage wall, resulting from both the disk-based parallel
file system (PFS) failing to keep pace with the compute and memory subsystems as well as the inefficiencies in end-to-end workflow processing. In the post-petaflop era, supercomputers are provisioned with flash devices, as an intermediary between compute nodes and the PFS, enabling novel paradigms not just for expediting I/O, but also for the in-situ analysis of the simulation output data on the flash device. An array of such active flash elements allows us to fundamentally rethink the way data analysis workflows interact with storage systems. By blending the flash storage array and data analysis together in a seamless fashion, we create an analysis workflow-aware storage
system, AnalyzeThis. Our guiding principle is that analysis-awareness be deeply ingrained in each and every layer of the storage system—active flash fabric, analysis object abstraction layer, scheduling layer within the storage, and an easy-to-use
file system interface—thereby elevating data analyses as first-class citizens. Together, these concepts transform AnalyzeThis into a potent analytics-aware appliance.
Advisors/Committee Members: Butt, Ali Raza Ashraf (committeechair), Vazhkudai, Sudharshan S. (committee member), Jung, Changhee (committee member).
Subjects/Keywords: File System; Distributed System
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sim, H. (2014). AnalyzeThis: An Analysis Workflow-Aware Storage System. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/76927
Chicago Manual of Style (16th Edition):
Sim, Hyogi. “AnalyzeThis: An Analysis Workflow-Aware Storage System.” 2014. Masters Thesis, Virginia Tech. Accessed December 14, 2019.
http://hdl.handle.net/10919/76927.
MLA Handbook (7th Edition):
Sim, Hyogi. “AnalyzeThis: An Analysis Workflow-Aware Storage System.” 2014. Web. 14 Dec 2019.
Vancouver:
Sim H. AnalyzeThis: An Analysis Workflow-Aware Storage System. [Internet] [Masters thesis]. Virginia Tech; 2014. [cited 2019 Dec 14].
Available from: http://hdl.handle.net/10919/76927.
Council of Science Editors:
Sim H. AnalyzeThis: An Analysis Workflow-Aware Storage System. [Masters Thesis]. Virginia Tech; 2014. Available from: http://hdl.handle.net/10919/76927
Universidade de Lisboa
2.
Martins, Rui Miguel Coelho.
Security features using a distributed file system.
Degree: 2011, Universidade de Lisboa
URL: http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/13929
► Sensitive information such as firewall logs or data from intrusion detection systems, has to be stored for long periods of time for legal reasons or…
(more)
▼ Sensitive information such as firewall logs or data from intrusion detection systems, has to be stored for long periods of time for legal reasons or for later forensic analysis. With the growth of the sources generating this type of data within a company, it is imperative to find a solution that meets the requirements of scalability, security, availability, performance and low maintenance while keeping the costs under control. Following this need, this project aims to make an analysis of
several distributed
file systems in order to find a solution that meets both the performance and security requirements of an internal application of Portugal Telecom. To validate the solution, the project includes the design of a prototype that aims to simulate the execution environment of that
application.
Advisors/Committee Members: Greg, Ganger, Bessani, Alysson.
Subjects/Keywords: distributed; performance; security; file system
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Martins, R. M. C. (2011). Security features using a distributed file system. (Thesis). Universidade de Lisboa. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/13929
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Martins, Rui Miguel Coelho. “Security features using a distributed file system.” 2011. Thesis, Universidade de Lisboa. Accessed December 14, 2019.
http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/13929.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Martins, Rui Miguel Coelho. “Security features using a distributed file system.” 2011. Web. 14 Dec 2019.
Vancouver:
Martins RMC. Security features using a distributed file system. [Internet] [Thesis]. Universidade de Lisboa; 2011. [cited 2019 Dec 14].
Available from: http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/13929.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Martins RMC. Security features using a distributed file system. [Thesis]. Universidade de Lisboa; 2011. Available from: http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/13929
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Michigan Technological University
3.
Hu, Lihui.
A FIREWALL MODEL OF FILE SYSTEM SECURITY.
Degree: PhD, Department of Computer Science, 2014, Michigan Technological University
URL: http://digitalcommons.mtu.edu/etds/786
► File system security is fundamental to the security of UNIX and Linux systems since in these systems almost everything is in the form of…
(more)
▼ File system security is fundamental to the security of UNIX and Linux systems since in these systems almost everything is in the form of a
file. To protect the
system files and other sensitive user files from unauthorized accesses, certain security schemes are chosen and used by different organizations in their computer systems. A
file system security model provides a formal description of a protection
system. Each security model is associated with specified security policies which focus on one or more of the security principles: confidentiality, integrity and availability. The security policy is not only about “who” can access an object, but also about “how” a
subject can access an object. To enforce the security policies, each access request is checked against the specified policies to decide whether it is allowed or rejected.
The current protection schemes in UNIX/Linux systems focus on the access control. Besides the basic access control scheme of the
system itself, which includes permission bits, setuid and seteuid mechanism and the root, there are other protection models, such as Capabilities, Domain Type Enforcement (DTE) and Role-Based Access Control (RBAC), supported and used in certain organizations. These models protect the confidentiality of the data directly. The integrity of the data is protected indirectly by only allowing trusted users to operate on the objects. The access control decisions of these models depend on either the identity of the user or the attributes of the process the user can execute, and the attributes of the objects. Adoption of these sophisticated models has been slow; this is likely due to the enormous complexity of specifying controls over a large
file system and the need for
system administrators to learn a new paradigm for
file protection.
We propose a new security model:
file system firewall. It is an adoption of the familiar network firewall protection model, used to control the data that flows between networked computers, toward
file system protection. This model can support decisions of access control based on any
system generated attributes about the access requests, e.g., time of day. The access control decisions are not on one entity, such as the account in traditional discretionary access control or the domain name in DTE. In
file system firewall, the access decisions are made upon situations on multiple entities. A situation is programmable with predicates on the attributes of
subject, object and the
system.
File system firewall specifies the appropriate actions on these situations. We implemented the prototype of
file system firewall on SUSE Linux. Preliminary results of performance tests on the prototype indicate that the runtime overhead is acceptable. We compared
file system firewall with TE in SELinux to show that firewall model can accommodate many other access control models. Finally, we show the ease of use of firewall model. When firewall
system is restricted to specified part of the
system, all the other resources are not…
Advisors/Committee Members: Jean Mayo.
Subjects/Keywords: Access control; File system; Security; Computer Sciences
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hu, L. (2014). A FIREWALL MODEL OF FILE SYSTEM SECURITY. (Doctoral Dissertation). Michigan Technological University. Retrieved from http://digitalcommons.mtu.edu/etds/786
Chicago Manual of Style (16th Edition):
Hu, Lihui. “A FIREWALL MODEL OF FILE SYSTEM SECURITY.” 2014. Doctoral Dissertation, Michigan Technological University. Accessed December 14, 2019.
http://digitalcommons.mtu.edu/etds/786.
MLA Handbook (7th Edition):
Hu, Lihui. “A FIREWALL MODEL OF FILE SYSTEM SECURITY.” 2014. Web. 14 Dec 2019.
Vancouver:
Hu L. A FIREWALL MODEL OF FILE SYSTEM SECURITY. [Internet] [Doctoral dissertation]. Michigan Technological University; 2014. [cited 2019 Dec 14].
Available from: http://digitalcommons.mtu.edu/etds/786.
Council of Science Editors:
Hu L. A FIREWALL MODEL OF FILE SYSTEM SECURITY. [Doctoral Dissertation]. Michigan Technological University; 2014. Available from: http://digitalcommons.mtu.edu/etds/786
University of Missouri – Columbia
4.
Mahendru, Ajay.
Facilitating large data sharing in collaborative environment using Dropoff.
Degree: 2012, University of Missouri – Columbia
URL: http://hdl.handle.net/10355/33147
► Researchers belonging to multiple institutions forming a collaborative environment are increasingly working with large files and datasets, which they often need to share for their…
(more)
▼ Researchers belonging to multiple institutions forming a collaborative environment are increasingly working with large files and datasets, which they often need to share for their collaboration. There is no provision in the current generation systems to transfer large data among collaborators in multiple institutions, without having to provision user credentials at some common location that all collaborators can use. “Dropoff” is a
system for sharing large data combining several transport, storage and security methods to allow researchers to share large files quickly and easily for a specified period in a trusted environment. Dropoff is an enhanced implementation of a project called “Filesender” [5]. Dropoff provides services to upload a large
file from the user's machine and send a download URL link for the
file to recipients through email. It is enhanced to provide more security, administration services and additional upload/download features that are necessary and useful in a shared collaborative environment. The current project replaces the SimpleSAML authentication mechanism with a Shibboleth and X.509 certificate based authentication mechanism for authenticating users. It secures the download of a
file by forcing the recipients to authenticate and thus making sure that only the intended recipient downloads a
file. It allows the user to upload and share a
file from the user's data repository and download it to the data repository if one exists for that particular user. It also provides an implementation to have distributed administrator users such that the administrator can administer files belonging to the same organizational domain as the administrator.
Advisors/Committee Members: Springer, Gordon K. (Gordon Kent) (advisor).
Subjects/Keywords: big data; data sharing; shared file system
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Mahendru, A. (2012). Facilitating large data sharing in collaborative environment using Dropoff. (Thesis). University of Missouri – Columbia. Retrieved from http://hdl.handle.net/10355/33147
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Mahendru, Ajay. “Facilitating large data sharing in collaborative environment using Dropoff.” 2012. Thesis, University of Missouri – Columbia. Accessed December 14, 2019.
http://hdl.handle.net/10355/33147.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Mahendru, Ajay. “Facilitating large data sharing in collaborative environment using Dropoff.” 2012. Web. 14 Dec 2019.
Vancouver:
Mahendru A. Facilitating large data sharing in collaborative environment using Dropoff. [Internet] [Thesis]. University of Missouri – Columbia; 2012. [cited 2019 Dec 14].
Available from: http://hdl.handle.net/10355/33147.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Mahendru A. Facilitating large data sharing in collaborative environment using Dropoff. [Thesis]. University of Missouri – Columbia; 2012. Available from: http://hdl.handle.net/10355/33147
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Universidade do Rio Grande do Sul
5.
Kassick, Rodrigo Virote.
Reconfiguração automática de I/O para aplicações paralelas no sistema de arquivos dNFSp2.
Degree: 2010, Universidade do Rio Grande do Sul
URL: http://hdl.handle.net/10183/27666
► Diversas aplicações executadas em ambientes de cluster necessitam de uma área de armazenamento permanente com alta capacidade e que forneça uma visão homogênea dos dados…
(more)
▼ Diversas aplicações executadas em ambientes de cluster necessitam de uma área de armazenamento permanente com alta capacidade e que forneça uma visão homogênea dos dados entre todos os nós. Esta área compartilhada é comumente implementada através de um sistema de arquivos distribuído, permitindo o acesso através da abstração mais comum para gerenciamento de dados. A disparidade entre poder de processamento e desempenho de dispositivos de armazenamento atuais, no entanto, torna tais sistemas um ponto crítico ao desempenho de aplicações paralelas que lidam com grandes volumes de dados. Ambientes de cluster podem apresentar execução concorrente de aplicações em conjuntos independentes de máquinas. Desta forma, uma grande quantidade de clientes com características distintas farão acessos ao sistema de arquivos compartilhado. Em tais casos, o dimensionamento do sistema de armazenamento distribuído nem sempre poderá prover o desempenho necessário à execução das aplicações com os recursos inicialmente a ele destinados. O presente trabalho propõe uma estratégia de reconfiguração dinâmica para o sistema de arquivos dNFSp. Esta estratégia leva em consideração o comportamento temporal presente em aplicações paralelas para inserir servidores de dados exclusivos a aplicações com alta demanda de I/O. Com a utilização de servidores exclusivos, torna-se possível isolar aplicações com comportamentos que causam grande perda de desempenho no sistema como um todo. Foi desenvolvida uma ferramenta de monitoramento do desempenho junto aos servidores do dNFSp, de forma a solicitar novos servidores apenas quando a interação das fases de I/O das aplicações em execução interferirem no desempenho do sistema. Esses novos servidores são solicitados para um sistema escalonador de recursos para cluster, de forma a utilizar nós livres para o armazenamento de dados. Os resultados mostram que a estratégia proposta é capaz de detectar a saturação do sistema de armazenamento e iniciar os servidores exclusivos, levando a um ganho de desempenho para as aplicações em execução. A reconfiguração dinâmica também mostrou-se capaz de evitar baixos desempenhos causados pela interação dos períodos de inatividade de aplicações temporais e pela utilização de diversos processos de I/O em um único nó.
Several applications executed in cluster environments need a shared storage area with high capacity and a homogeneous view of the stored data to all processing nodes. This area is commonly implemented as a distributed file system, allowing the access to data through the well-known file abstraction. The great gap in performance of processors and storage devices, on the other hand, makes such system a critical point to the performance of parallel applications. A common trait of large cluster environments is the concurrent execution of applications. In this scenario, many clients with distinct behaviors will compete to access the shared storage system. The number of I/O resources originally dedicated to this shared storage may provide unsatisfactory performance to the…
Advisors/Committee Members: Navaux, Philippe Olivier Alexandre.
Subjects/Keywords: Arquivos distribuidos; Storage; Sistemas : Arquivos; Paralle file system; Dynamic file system; Processamento : Alto desempenho
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kassick, R. V. (2010). Reconfiguração automática de I/O para aplicações paralelas no sistema de arquivos dNFSp2. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/27666
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Kassick, Rodrigo Virote. “Reconfiguração automática de I/O para aplicações paralelas no sistema de arquivos dNFSp2.” 2010. Thesis, Universidade do Rio Grande do Sul. Accessed December 14, 2019.
http://hdl.handle.net/10183/27666.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kassick, Rodrigo Virote. “Reconfiguração automática de I/O para aplicações paralelas no sistema de arquivos dNFSp2.” 2010. Web. 14 Dec 2019.
Vancouver:
Kassick RV. Reconfiguração automática de I/O para aplicações paralelas no sistema de arquivos dNFSp2. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2010. [cited 2019 Dec 14].
Available from: http://hdl.handle.net/10183/27666.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kassick RV. Reconfiguração automática de I/O para aplicações paralelas no sistema de arquivos dNFSp2. [Thesis]. Universidade do Rio Grande do Sul; 2010. Available from: http://hdl.handle.net/10183/27666
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Universidade Nova
6.
Martins, Artur Miguel Adriano.
Transactional filesystems.
Degree: 2008, Universidade Nova
URL: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/4193
► Dissertação de Mestrado em Engenharia Informática
The task of implementing correct software is not trivial; mainly when facing the need for supporting concurrency. To overcome…
(more)
▼ Dissertação de Mestrado em Engenharia Informática
The task of implementing correct software is not trivial; mainly when facing the need for supporting concurrency. To overcome this difficulty, several researchers proposed the technique of providing the well known database transactional models as an abstraction for existing programming languages, allowing a software programmer to define groups of computations as transactions and benefit from the expectable semantics of the underlying transactional model. Prototypes for this programming model are nowadays made available by many research teams but are still far from perfection due to a considerable number of operational restrictions. Mostly, these restrictions derive from the limitations on the use of input-output functions inside a transaction. These functions are frequently irreversible which disables their compatibility with a transactional engine due to its impossibility to undo their effects in the event of aborting a transaction.
However, there is a group of input-output operations that are potentially reversible and that can produce a valuable tool when provided within the transactional programming model explained above: the file system operations. A programming model that would involve in a transaction not only a set of memory operations but also a set of file operations, would allow the software programmer to define algorithms in a much flexible and simple way, reaching greater stability and consistency in each application.
In this document we purpose to specify and allow the use of this type of operations inside a transactional programming model, as well as studying the advantages and disadvantages of this approach.
Advisors/Committee Members: Lourenço, João.
Subjects/Keywords: Transactional file system; File system; Transactional memory; Software transactional memory; Linux; Transactional locking II
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Martins, A. M. A. (2008). Transactional filesystems. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/4193
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Martins, Artur Miguel Adriano. “Transactional filesystems.” 2008. Thesis, Universidade Nova. Accessed December 14, 2019.
http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/4193.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Martins, Artur Miguel Adriano. “Transactional filesystems.” 2008. Web. 14 Dec 2019.
Vancouver:
Martins AMA. Transactional filesystems. [Internet] [Thesis]. Universidade Nova; 2008. [cited 2019 Dec 14].
Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/4193.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Martins AMA. Transactional filesystems. [Thesis]. Universidade Nova; 2008. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/4193
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
NSYSU
7.
Chang, Yu-han.
Improving Detection Efficiency using Cloud Computing.
Degree: Master, Information Management, 2016, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0730116-223811
► Recently, with the popularity and convenience features of Internet, Internet has become one of the attacker profitable way to enter the local area network. Most…
(more)
▼ Recently, with the popularity and convenience features of Internet, Internet has become one of the attacker profitable way to enter the local area network. Most organizations, companies and government agencies will purchase the firewall, intrusion detection systems, intrusion prevention systems or other information security
system to prevent and defense their network.
With the increasing of the security infrastructure and
system, these problems can have a significant impact on organizations. For example, All kinds of Raw Log Messages in different formats and big data storage are important issues. The traditional data analysis architecture by means of a powerful server has serious performance issues when processing big data.
This study proposes a cloud computing architecture by deploy the settings of storage space, number of namenode and datanode, CPU, memory and network bandwidth to make cloud computing
system more efficacy. This study proposes an open source cloud computing platform solution for storing and analyzing big data. Clustered and distributed storage provided by the open source cloud platform, Hadoop, improves the time and storage issue faced in traditional centralized architecture. To improve the bottleneck of the read/write access time during big data processing, in-memory processing technology, Spark, is adopted to reduce the number of disk accesses. The experimental results demonstrate that the proposed cloud platform provides a great performance improvement.
Advisors/Committee Members: Chih-Hung Wang (chair), Chia-Mai Chen (committee member), Hui-Tang Lin (chair), Gu-Hsin Lai (chair).
Subjects/Keywords: Distributed File System; Cloud Computing; Intrusion Detection System
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chang, Y. (2016). Improving Detection Efficiency using Cloud Computing. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0730116-223811
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Chang, Yu-han. “Improving Detection Efficiency using Cloud Computing.” 2016. Thesis, NSYSU. Accessed December 14, 2019.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0730116-223811.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chang, Yu-han. “Improving Detection Efficiency using Cloud Computing.” 2016. Web. 14 Dec 2019.
Vancouver:
Chang Y. Improving Detection Efficiency using Cloud Computing. [Internet] [Thesis]. NSYSU; 2016. [cited 2019 Dec 14].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0730116-223811.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chang Y. Improving Detection Efficiency using Cloud Computing. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0730116-223811
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Louisiana State University
8.
Yang, Shuangyang.
A Persistent Storage Model for Extreme Computing.
Degree: PhD, Computer Sciences, 2014, Louisiana State University
URL: etd-10312014-133428
;
https://digitalcommons.lsu.edu/gradschool_dissertations/2910
► The continuing technological progress resulted in a dramatic growth in aggregate computational performance of the largest supercomputing systems. Unfortunately, these advances did not translate to…
(more)
▼ The continuing technological progress resulted in a dramatic growth in aggregate computational performance of the largest supercomputing systems. Unfortunately, these advances did not translate to the required extent into accompanying I/O systems and little more in terms of architecture or effective access latency. New classes of algorithms developed for massively parallel applications, that gracefully handle the challenges of asynchrony, heavily multi-threaded distributed codes, and message-driven computation, must be matched by similar advances in I/O methods and algorithms to produce a well performing and balanced supercomputing system. This dissertation proposes PXFS, a storage model for persistent objects inspired by the ParalleX model of execution that addresses many of these challenges. The PXFS model is designed to be asynchronous in nature to comply with ParalleX model and proposes an active TupleSpace concept to hold all kinds of metadata/meta-object for either storage objects or runtime objects. The new active TupleSpace can also register ParalleX actions to be triggered under certain tuple operations. An first implementation of PXFS utilizing a well-known Orange parallel file system as its back-end via asynchronous I/O layer and the implementation of TupleSpace component in HPX, the implementation of ParalleX. These details are also described along with the preliminary performance data. A house-made micro benchmark is developed to measure the disk I/O throughput of the PXFS asynchronous interface. The results show perfect scalability and 3x to 20x times speedup of I/O throughput performance comparing to OrangeFS synchronous user interface. Use cases of TupleSpace components are discussed for real-world applications including micro check-pointing. By utilizing TupleSpace in HPX applications for I/O, global barrier can be replaced with fine-grained parallelism to overlap more computation with communication and greatly boost the performance and efficiency. Also the dissertation showcases the distributed directory service in Orange file system which process directory entries in parallel and effectively improves the directory metada operations.
Subjects/Keywords: parallel computing; parallel file system; parallel runtime system
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yang, S. (2014). A Persistent Storage Model for Extreme Computing. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-10312014-133428 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2910
Chicago Manual of Style (16th Edition):
Yang, Shuangyang. “A Persistent Storage Model for Extreme Computing.” 2014. Doctoral Dissertation, Louisiana State University. Accessed December 14, 2019.
etd-10312014-133428 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2910.
MLA Handbook (7th Edition):
Yang, Shuangyang. “A Persistent Storage Model for Extreme Computing.” 2014. Web. 14 Dec 2019.
Vancouver:
Yang S. A Persistent Storage Model for Extreme Computing. [Internet] [Doctoral dissertation]. Louisiana State University; 2014. [cited 2019 Dec 14].
Available from: etd-10312014-133428 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2910.
Council of Science Editors:
Yang S. A Persistent Storage Model for Extreme Computing. [Doctoral Dissertation]. Louisiana State University; 2014. Available from: etd-10312014-133428 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2910
9.
Qiu, Sheng.
Integration of Non-volatile Memory into Storage Hierarchy.
Degree: 2013, Texas A&M University
URL: http://hdl.handle.net/1969.1/151835
► In this dissertation, we present novel approaches for integrating non-volatile memory devices into storage hierarchy of a computer system. There are several types of non-…
(more)
▼ In this dissertation, we present novel approaches for integrating non-volatile memory devices into storage hierarchy of a computer
system. There are several types of non- volatile memory devices, such as flash memory, Phase Change Memory (PCM), Spin- transfer torque memory (STT-RAM). These devices have many appealing features for applications; however, they also offer several challenges. This dissertation is focused on how to efficiently integrate these non-volatile memories into existing memory and disk storage systems. This work is composed of two major parts.
The first part investigates a main-memory
system employing Phase Change Memory instead of traditional DRAM. Compared to DRAM, PCM has higher density and no static power consumption, which are very important factors for building large capacity memory systems. However, PCM has higher write latency and power consumption compared to read operations. Moreover, PCM has limited write endurance. To efficiently integrate PCM into a memory
system, we have to solve the challenges brought by its expensive write operations. We propose new replacement policies and cache organizations for the last-level CPU cache, which can effectively reduce the write traffic to the PCM main memory. We evaluated our design with multiple workloads and configurations. The results show that the proposed approaches improve the lifetime and energy consumption of PCM significantly.
The second part of the dissertation considers the design of a data/disk storage using non-volatile memories, e.g. flash memory, PCM and nonvolatile DIMMs. We consider multiple design options for utilizing the nonvolatile memories in the storage hierarchy. First, we consider a
system that employs nonvolatile memories such as PCM or nonvolatile DIMMs on memory bus along with flash-based SSDs. We propose a hybrid
file system, NVMFS, that manages both these devices. NVMFS exploits the nonvolatile memory to improve the characteristics of the write workload at the SSD. We satisfy most small random write requests on the fast nonvolatile DIMM and only do large and optimized writes on SSD. We also group data of similar update patterns together before writing to flash-SSD; as a result, we can effectively reduce the garbage collection overhead. We implemented a prototype of NVMFS in Linux and evaluated its performance through multiple benchmarks.
Secondly, we consider the problem of using flash memory as a cache for a disk drive based storage
system. Since SSDs are expensive, a few SSDs are designed to serve as a cache for a large number of disk drives. SSD cache space can be used for both read and write requests. In our design, we managed multiple flash-SSD devices directly at the cache layer without the help of RAID software. To ensure data reliability and cache space efficiency, we only duplicated dirty data on flash- SSDs. We also balanced the write endurance of different flash-SSDs. As a result, no single SSD will fail much earlier than the others.
Thirdly, when using PCM-like devices only as data storage, it?s possible…
Advisors/Committee Members: Reddy, A. L. Narasimha (advisor), Bettati, Riccardo (committee member), Gratz, Paul (committee member), Narayanan, Krishna (committee member).
Subjects/Keywords: storage; file system
…management hardware resources to improve file system performance. However, in this
case, SCM may… …file system, NVMFS, which utilizes nonvolatile DIMMs to absorb
the small random write… …resources such
as the TLB. As a result, the file system performance is further improved. We also… …45
3.7
Write traffic to SSD under different workloads and file systems . . . .
50
3.8… …size issued to SSD under different workloads and
file systems…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Qiu, S. (2013). Integration of Non-volatile Memory into Storage Hierarchy. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151835
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Qiu, Sheng. “Integration of Non-volatile Memory into Storage Hierarchy.” 2013. Thesis, Texas A&M University. Accessed December 14, 2019.
http://hdl.handle.net/1969.1/151835.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Qiu, Sheng. “Integration of Non-volatile Memory into Storage Hierarchy.” 2013. Web. 14 Dec 2019.
Vancouver:
Qiu S. Integration of Non-volatile Memory into Storage Hierarchy. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Dec 14].
Available from: http://hdl.handle.net/1969.1/151835.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Qiu S. Integration of Non-volatile Memory into Storage Hierarchy. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151835
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Kaunas University of Technology
10.
Tamašauskas,
Giedrius.
Saugi „Apache“ žiniatinklio serverio failų
sistema.
Degree: Master, Informatics
Engineering, 2010, Kaunas University of Technology
URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100825_105728-84937
;
► „Apache“ yra vienas iš populiariausių žiniatinklio serverių. Pagrindinis šio darbo tikslas sukurti saugią „Apache“ žiniatinklio serverio failų sistemą. Darbe analizuojant „Apache“ žiniatinklio ir kitų failų…
(more)
▼ „Apache“ yra vienas iš populiariausių
žiniatinklio serverių. Pagrindinis šio darbo tikslas sukurti saugią
„Apache“ žiniatinklio serverio failų sistemą. Darbe analizuojant
„Apache“ žiniatinklio ir kitų failų sistemų saugos galimybes
nustatyta, kad šio serverio failų sistemos saugos galimybės yra
ribotos. Kad „Apache“ žiniatinklio failų sistema būtų saugi
pridedamos keturios papildomos savybės, tai žurnaliavimas, saugus
failo ištrynimas, duomenų šifravimas jų saugojimo metu, bei
lankstesnis vartotojų prieigos valdymas. Darbe realizuota vartotojo
grafinė sąsaja, kurios dėka suteikiamos saugios failų sistemos
savybės savininko duomenims apsaugoti. Realizuojamoje grafinėje
sąsajoje duomenų savininkas lanksčiau ir aiškiau suteikia saugios
failų sistemos savybes savo duomenims, neįvedinėdamas komandinių
eilučių ir neredaguodamas konfigūracinių
failų.
“Apache” is the one of the most popular web
server. The main objective of this work is to create a secure file
system for “Apache” web server. The paper analyzes the “Apache” Web
files and other safety systems. This paper points out and explores
the security limitations of existing server file system. For the
“Apache” Web files system to be more secured it was added four
additional properties: journaling, secure file deletion, data
encryption during storage and flexible user access management. The
paper implemented the new user graphical interface, which provides
safe features for the file system to increase the protection of the
owner. New graphic interface allows the authorized owner to be more
flexible and faster in securing data managing in this file system,
eliminating the need of command line and editing configurations
files manually.
Advisors/Committee Members: Jusas, Vacius (Master’s degree committee member), Bareiša, Eduardas (Master’s degree committee member), Kazanavičius, Egidijus (Master’s degree committee member), Kandratavičius, Irmantas (Master’s degree committee chair), Venčkauskas, Algimantas (Master’s degree session secretary), Kavaliūnas, Rimantas (Master’s degree committee member), Sakalauskas, Eligijus (Master’s degree committee member), Toldinas, Eugenijus (Master’s degree committee member), Ziberkas, Giedrius (Master’s thesis reviewer), Venčkauskas, Algimantas (Master’s thesis supervisor).
Subjects/Keywords: "Apache"; Failų sistema; Sauga; Serveris; "Apache"; File system; Security; Server
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Tamašauskas,
Giedrius. (2010). Saugi „Apache“ žiniatinklio serverio failų
sistema. (Masters Thesis). Kaunas University of Technology. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100825_105728-84937 ;
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
Tamašauskas,
Giedrius. “Saugi „Apache“ žiniatinklio serverio failų
sistema.” 2010. Masters Thesis, Kaunas University of Technology. Accessed December 14, 2019.
http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100825_105728-84937 ;.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
Tamašauskas,
Giedrius. “Saugi „Apache“ žiniatinklio serverio failų
sistema.” 2010. Web. 14 Dec 2019.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
Tamašauskas,
Giedrius. Saugi „Apache“ žiniatinklio serverio failų
sistema. [Internet] [Masters thesis]. Kaunas University of Technology; 2010. [cited 2019 Dec 14].
Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100825_105728-84937 ;.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
Tamašauskas,
Giedrius. Saugi „Apache“ žiniatinklio serverio failų
sistema. [Masters Thesis]. Kaunas University of Technology; 2010. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100825_105728-84937 ;
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
California State University – Sacramento
11.
Bharat, Puneetha.
Bluetooth broadcasting system.
Degree: MS, Computer Science, 2017, California State University – Sacramento
URL: http://hdl.handle.net/10211.3/198341
► Bluetooth is a short-range communication system that was developed with the intent of replacing cables that link portable and fixed electronic devices. Given its widespread…
(more)
▼ Bluetooth is a short-range communication
system that was developed with the intent of replacing cables that link portable and fixed electronic devices. Given its widespread adoption, especially in mobile devices, new uses are possible today. Although there are many proprietary solutions in the market for open source operating systems, they are based on unicast architecture. The problem faced is that there are not Bluetooth broadcasting systems for open source operating systems. The project addresses this issue, in that, it attempts to provide an open source, cost-effective solution to broadcast messages on the go using short-range wireless technology
This project aims to create an open source Bluetooth broadcasting
system which detects Bluetooth enabled devices like laptops/phones/smart devices and sends information on the go and is developed using Bluez open source which is a Bluetooth stack on a Linux operating
system.
With devices continuously evolving and the Bluetooth technology being improved, it is possible that Bluetooth broadcasting can be used for delivering a wider range of information in the near future at higher speeds than now.
Advisors/Committee Members: Ouyang, Jinsong.
Subjects/Keywords: Short-range wireless technology; File transfer; Open source bluetooth broadcasting system
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Bharat, P. (2017). Bluetooth broadcasting system. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.3/198341
Chicago Manual of Style (16th Edition):
Bharat, Puneetha. “Bluetooth broadcasting system.” 2017. Masters Thesis, California State University – Sacramento. Accessed December 14, 2019.
http://hdl.handle.net/10211.3/198341.
MLA Handbook (7th Edition):
Bharat, Puneetha. “Bluetooth broadcasting system.” 2017. Web. 14 Dec 2019.
Vancouver:
Bharat P. Bluetooth broadcasting system. [Internet] [Masters thesis]. California State University – Sacramento; 2017. [cited 2019 Dec 14].
Available from: http://hdl.handle.net/10211.3/198341.
Council of Science Editors:
Bharat P. Bluetooth broadcasting system. [Masters Thesis]. California State University – Sacramento; 2017. Available from: http://hdl.handle.net/10211.3/198341
NSYSU
12.
Yang, Cheng-hao.
Design and Implementation of Distributed Data Storage Architecture with Building Windows Kernel Driver.
Degree: Master, Electrical Engineering, 2013, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720113-162714
► Distributed file system is one of the basic architecture in the Big Data network system. In this paper, new distributed data storage architecture is proposed,…
(more)
▼ Distributed
file system is one of the basic architecture in the Big Data network
system. In this paper, new distributed data storage architecture is proposed, achieving a major breakthrough in the Windows 7 operating
system. The kernel-mode driver is used to establish the network working platform.
The research can be divided into three parts: client, master and storage. For the client, users can operate the
system with the designed interface, which uses the idea of the event I/O to communicate with a kernel driver. The master is responsible for managing storages, and receiving commands from the client. A series of data structures are also established to record the clientâs
file logical path. For the storage part, consistency commands make all the remote computers transformed into logical disks, which are provided to the client.
In order to have a more effective communication, a new network protocol is defined. The commands from the protocol are for controlling the kernel driver. Therefore, the proposed distributed data storage architecture can be constructed successfully.
Two experiments are made based on the distributed data storage architecture. According to the upload experiment, the average upload speed is about 8.057 MB per second. On the other hand, the average speed for downloading is about 8.338 MB per second.
Advisors/Committee Members: Tong-Yu Hsieh (chair), Jih-ching Chiu (committee member), Jih-ching Chiu (chair), Da-Wei Chang (chair), Shiann-Rong Kuang (chair).
Subjects/Keywords: Windows Kernel Mode Driver; Multithreading; Synchronization; Distributed File System; Network Protocol
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yang, C. (2013). Design and Implementation of Distributed Data Storage Architecture with Building Windows Kernel Driver. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720113-162714
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Yang, Cheng-hao. “Design and Implementation of Distributed Data Storage Architecture with Building Windows Kernel Driver.” 2013. Thesis, NSYSU. Accessed December 14, 2019.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720113-162714.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Yang, Cheng-hao. “Design and Implementation of Distributed Data Storage Architecture with Building Windows Kernel Driver.” 2013. Web. 14 Dec 2019.
Vancouver:
Yang C. Design and Implementation of Distributed Data Storage Architecture with Building Windows Kernel Driver. [Internet] [Thesis]. NSYSU; 2013. [cited 2019 Dec 14].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720113-162714.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Yang C. Design and Implementation of Distributed Data Storage Architecture with Building Windows Kernel Driver. [Thesis]. NSYSU; 2013. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720113-162714
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
NSYSU
13.
Tsai, Chia-ping.
Design and Implementation of Cloud Data Backup System with Load Balance Strategy.
Degree: Master, Electrical Engineering, 2012, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0815112-131044
► The fast growing bandwidth has made the development of cloud storage. More and more resource has put in cloud storage. In this thesis, we proposed…
(more)
▼ The fast growing bandwidth has made the development of cloud storage. More and more resource has put in cloud storage. In this thesis, we proposed a new cloud storage that consists of a single main server and multiple data servers. The main server controls
system-wide activities such as data server management. It also periodically communicates with each data server and collects its state. Data servers store data on local disks as Windows files. In order to response to the large number of data access, Selection of the server which is necessary to offer equalized performance. In this paper, we propose a server selection algorithm using different parameters to get the performance metrics which enables us to balance multi-resource from server-side.
We design new cloud storage and implement the algorithm. According to upload experiment, the difference between the maximum and the minimum free space when using our algorithm is less than 5GB. But using the random mode, the free space difference is increased as time, and the maximum is 30GB. In the mixed experiment, we added the download mode, and our algorithm is fewer than 10GB. The result of the random mode approximated to the first experiment. Finally, our algorithm obtains 10% and 3% speedup in upload throughput by upload experiment and mixed experiment, 10% speedup in download throughput by mixed experiment.
Advisors/Committee Members: Jih-Ching Chiu (committee member), Da-Wei Chang (chair), Zi-Tsan Chou (chair), Xian-Rong Kuang (chair).
Subjects/Keywords: Cloud Storage; Server Selection; Distributed File System; Multithreading; Synchronization
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Tsai, C. (2012). Design and Implementation of Cloud Data Backup System with Load Balance Strategy. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0815112-131044
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Tsai, Chia-ping. “Design and Implementation of Cloud Data Backup System with Load Balance Strategy.” 2012. Thesis, NSYSU. Accessed December 14, 2019.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0815112-131044.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Tsai, Chia-ping. “Design and Implementation of Cloud Data Backup System with Load Balance Strategy.” 2012. Web. 14 Dec 2019.
Vancouver:
Tsai C. Design and Implementation of Cloud Data Backup System with Load Balance Strategy. [Internet] [Thesis]. NSYSU; 2012. [cited 2019 Dec 14].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0815112-131044.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Tsai C. Design and Implementation of Cloud Data Backup System with Load Balance Strategy. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0815112-131044
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Penn State University
14.
Son, Seung Woo.
Software-Based Disk Power Management for Scientific
Applications.
Degree: PhD, Computer Science and Engineering, 2008, Penn State University
URL: https://etda.libraries.psu.edu/catalog/8847
► Power consumption by high-performance systems is becoming an increasing concern for system designers and software writers a like. Disk subsystem is known to be a…
(more)
▼ Power consumption by high-performance systems is
becoming an increasing concern for system designers and software
writers a like. Disk subsystem is known to be a major contributor
to the overall power budget of high-performance systems. Most
scientific applications today rely heavily on disk I/O for
out-of-core computations, checkpointing, and data visualization. To
reduce excess energy consumption on disk system, prior studies
proposed several hardware or OS-based disk power management
schemes. While such schemes have been known to be effective in
certain cases, they might miss opportunities for better energy
savings due to their reactive nature. While compiler based schemes
can make more accurate decisions on a given application by
extracting disk access patterns statically, the lack of runtime
information on the status of shared disks may lead to wrong
decisions when multiple applications exercise the same set of disks
concurrently. Therefore, quantitative comparison of reactive,
compiler-based, and hybrid schemes is very important. This
dissertation makes four major contributions towards more effective
disk power management for scientific applications that use
disk-resident data frequently (i.e., so called I/O-intensive
applications). First, it shows that, while conventional hardware
based disk power management scheme is useful in certain cases,
compiler-driven approach can be more effective for array-based
scientific applications executing on parallel architectures.
Second, it shows that restructuring the application code increases
length of disk idle periods, thereby leading to better exploitation
of available power-saving capabilities. Third, it proposes a
compiler-directed energy-aware prefetching scheme for scientific
applications that process disk-resident data sets. Finally, it
proposes a runtime system support for software-based disk power
management scheme. The proposed runtime system is implemented
within PVFS2, a parallel file system. We conclude by a brief
discussion of ongoing and future work on I/O.
Subjects/Keywords: Low power; compiler; disk subsystem; parallel file system;
runtime
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Son, S. W. (2008). Software-Based Disk Power Management for Scientific
Applications. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/8847
Chicago Manual of Style (16th Edition):
Son, Seung Woo. “Software-Based Disk Power Management for Scientific
Applications.” 2008. Doctoral Dissertation, Penn State University. Accessed December 14, 2019.
https://etda.libraries.psu.edu/catalog/8847.
MLA Handbook (7th Edition):
Son, Seung Woo. “Software-Based Disk Power Management for Scientific
Applications.” 2008. Web. 14 Dec 2019.
Vancouver:
Son SW. Software-Based Disk Power Management for Scientific
Applications. [Internet] [Doctoral dissertation]. Penn State University; 2008. [cited 2019 Dec 14].
Available from: https://etda.libraries.psu.edu/catalog/8847.
Council of Science Editors:
Son SW. Software-Based Disk Power Management for Scientific
Applications. [Doctoral Dissertation]. Penn State University; 2008. Available from: https://etda.libraries.psu.edu/catalog/8847
University of California – Santa Cruz
15.
Yang, Jingpei.
Improving Performance for Flash-Based Storage Systems.
Degree: Computer Science, 2014, University of California – Santa Cruz
URL: http://www.escholarship.org/uc/item/7w70s24f
► With the dramatic advances in electronic device industry, the availability of high speed non-volatile memory (NVRAM) has introduced a new tier into the storage hierarchy,…
(more)
▼ With the dramatic advances in electronic device industry, the availability of high speed non-volatile memory (NVRAM) has introduced a new tier into the storage hierarchy, and holds great promise for reduction in latency, power consumption, and improved performance. Among them, flash-memory has become a popular storage medium to replace hard disk as a permanent storage device and DRAM as a temporary storage device. Yet, despite their fast random I/O performance, the design of a flash-based storage system achieves suboptimal performance or suffers from reduced endurance due to the nature of flash memory, for example, out of place update, asymmetric read-write throughput, and limited write cycles. Lack of application aware design makes flash memory less efficient, and hence cannot meet various performance requirements. To this end, we investigate the roles flash memory plays in different storage applications and their performance and reliability requirements. By examining the behavior of these systems and their consequent data access characteristics, as well as the performance impact, we propose solutions that tradeoff performance, cost, endurance and reliability to achieve high efficiency for flash memory in different storage applications with reduced overhead. We first explore the use of flash memory as a write-through cache in a tiered storage. We demonstrate the individual and cumulative contributions of cache admission policy, cache eviction policy, flash garbage collection policy, and flash device configuration on a flash caching device. We show that workloads on Solid State Caches (SSCs) have significantly greater write pressures than their storage counterparts. we propose HEC, a High Endurance Cache that aims to improve overall device endurance via reduced media writes and erases while increasing or maintaining cache hit rate performance. To further characterize the behavior of flash memory used in different storage applications, we focus on flash as a primary backing storage device in the second part of this dissertation. We explore the drawbacks of a typical log-structured file system on top of a log-structured FTL flash device. We characterize the interactions between multiple levels of independent logs, and describe several practical scenarios which arises in real log-on-log systems. We then propose a log-aware coordination to tune the layout of logs, so that when multiple layers of logs exist in the system we can still achieve high performance with minimum interference among each log. In the third part of this dissertation, we explore the approaches to collapsing logs. While there are several popular ways that utilize the nature of flash memory translation layer to eliminate multiple layers of logs in the entire system, we focus on the benefit we can obtain from a log-less object-based flash aware system. We show from simulation experiments that advanced features could be embedded to improve overall performance for object-based flash system with low overhead through a rich interface.
Subjects/Keywords: Computer science; file system; flash memory; performance; storage
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yang, J. (2014). Improving Performance for Flash-Based Storage Systems. (Thesis). University of California – Santa Cruz. Retrieved from http://www.escholarship.org/uc/item/7w70s24f
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Yang, Jingpei. “Improving Performance for Flash-Based Storage Systems.” 2014. Thesis, University of California – Santa Cruz. Accessed December 14, 2019.
http://www.escholarship.org/uc/item/7w70s24f.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Yang, Jingpei. “Improving Performance for Flash-Based Storage Systems.” 2014. Web. 14 Dec 2019.
Vancouver:
Yang J. Improving Performance for Flash-Based Storage Systems. [Internet] [Thesis]. University of California – Santa Cruz; 2014. [cited 2019 Dec 14].
Available from: http://www.escholarship.org/uc/item/7w70s24f.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Yang J. Improving Performance for Flash-Based Storage Systems. [Thesis]. University of California – Santa Cruz; 2014. Available from: http://www.escholarship.org/uc/item/7w70s24f
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Virginia Tech
16.
Mantri, Sushil Govindnarayan.
Efficient In-Depth IO Tracing and its application for optimizing systems.
Degree: MS, Computer Science, 2014, Virginia Tech
URL: http://hdl.handle.net/10919/50145
► Understanding user and system behavior is most vital for designing efficient systems. Most systems are designed with certain user workload in mind. However, such workloads…
(more)
▼ Understanding user and
system behavior is most vital for designing efficient systems. Most
systems are designed with certain user workload in mind. However, such workloads evolve
over time, or the underlying hardware assumptions change. Further, most modern systems
are not built or deployed in isolation, they interact with other systems whose behavior might
not be exactly understood. Thus in order to understand the performance of a
system, it
must be inspected closely while user workloads are running. Such close inspection must be
done with minimum disturbance to the user workload. Thus tracing or collection of all the
user and
system generated events becomes an important approach in gaining comprehensive
insight in user behavior.
As part of this work, we have three major contributions. We designed and implemented
an in-depth block level I/O tracer, which would collect block level information like sector
number, size of the I/O, actual contents of the I/O, along with certain
file system information
like filename, and offset in the
file, for every I/O request. Next, to minimize the impact of
the tracing to the running workload, we introduce and implement a sampling mechanism
which traces fewer I/O requests. We validate that this sampling preserves certain I/O access
patterns. Finally, as one of the application of our tracer, we use it as a crucial component
of a
system designed to do VM placements according to user workload.
Advisors/Committee Members: Butt, Ali Raza Ashraf (committeechair), Kafura, Dennis G. (committee member), Zhou, Pin (committee member).
Subjects/Keywords: I/O Tracing; VM placement; File-system tracing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Mantri, S. G. (2014). Efficient In-Depth IO Tracing and its application for optimizing systems. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/50145
Chicago Manual of Style (16th Edition):
Mantri, Sushil Govindnarayan. “Efficient In-Depth IO Tracing and its application for optimizing systems.” 2014. Masters Thesis, Virginia Tech. Accessed December 14, 2019.
http://hdl.handle.net/10919/50145.
MLA Handbook (7th Edition):
Mantri, Sushil Govindnarayan. “Efficient In-Depth IO Tracing and its application for optimizing systems.” 2014. Web. 14 Dec 2019.
Vancouver:
Mantri SG. Efficient In-Depth IO Tracing and its application for optimizing systems. [Internet] [Masters thesis]. Virginia Tech; 2014. [cited 2019 Dec 14].
Available from: http://hdl.handle.net/10919/50145.
Council of Science Editors:
Mantri SG. Efficient In-Depth IO Tracing and its application for optimizing systems. [Masters Thesis]. Virginia Tech; 2014. Available from: http://hdl.handle.net/10919/50145
Kansas State University
17.
Nory, Nawar A.
Design and
implementation of the Chunks feature.
Degree: MS, Department of Computing and
Information Sciences, 2008, Kansas State University
URL: http://hdl.handle.net/2097/911
► The recovery-driven design of the file system has been one of the most challenging fields over the major trends in operating systems. This field has…
(more)
▼ The recovery-driven design of the
file system has been
one of the most challenging fields
over the major trends in
operating systems. This field has assumed considerable importance
in the past decades as the disk sizes have been increasing without
a comparable increase in the disk I/O bandwidth and seek time. The
rapid increase in the storage size is expected to become constant
in the future due to the growing market demand and the continuous
database size increment of many companies and major businesses. Due
to the same reason, the cost of the average
file system checking
time has increased without a significant improvement in the disk
I/O bandwidth and seek time performance. Operating
system bugs,
power outages, and hardware failures which result in a
file system
crash were the main reasons behind the innovation of novel recovery
approaches such as Journaling and soft-updates. Although such
approaches avoided complete
file system checking by checking solely
inconsistencies in
file
system metadata, it become inevitable for
them to check the entire
file system for inconsistencies because of
the previously entioned types of problems. One of the emerging
recovery-driven designs which considers minimizing
file system
checking cost is the Chunkfs files ystem. Chunkfs
file system
introduces an innovative look into the
file system design by
dividing the
file system layout into smaller chunks, each one of
which represents a smaller scale
file system by itself.
In our
work we probed an alternative recovery-driven design which is
considerably inspired by the Chunkfs concepts and follows the same
design guidelines. This recovery-riven design is introduced by
adding a new feature to the
file system which best utilizes the
existing underlying design through considering the block groups as
individual chunks, confining their files and directories spanning
across different block groups by means of special controlled
continuation links. These links provide a fault isolation means by
circumscribing the
checking of the
file system to only these block
groups which appear to be dirty after a crash, a method resulting
in a moderate reduction in
file system checking cost. We also
probed different metrics of metadata sizes, and the probable cost
of files and directories expansion across the different block
groups.
Advisors/Committee Members: Daniel A. Andresen.
Subjects/Keywords: File
system; Computer Science (0984)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Nory, N. A. (2008). Design and
implementation of the Chunks feature. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/911
Chicago Manual of Style (16th Edition):
Nory, Nawar A. “Design and
implementation of the Chunks feature.” 2008. Masters Thesis, Kansas State University. Accessed December 14, 2019.
http://hdl.handle.net/2097/911.
MLA Handbook (7th Edition):
Nory, Nawar A. “Design and
implementation of the Chunks feature.” 2008. Web. 14 Dec 2019.
Vancouver:
Nory NA. Design and
implementation of the Chunks feature. [Internet] [Masters thesis]. Kansas State University; 2008. [cited 2019 Dec 14].
Available from: http://hdl.handle.net/2097/911.
Council of Science Editors:
Nory NA. Design and
implementation of the Chunks feature. [Masters Thesis]. Kansas State University; 2008. Available from: http://hdl.handle.net/2097/911
Oklahoma State University
18.
Yu, Li.
Enabling Efficient Fault Tolerance in Distributed File Systems Through Erasure Codes.
Degree: Computer Science Department, 2011, Oklahoma State University
URL: http://hdl.handle.net/11244/8273
► Over the past few years, distributed file systems have been widely used as substantial infrastructures and key components of current large-scale Internet applications. By the…
(more)
▼ Over the past few years, distributed file systems have been widely used as substantial infrastructures and key components of current large-scale Internet applications. By the nature of storage systems, a lot of existing distributed file systems focus more on the aspect of data availability and fault tolerance. A practical and popular solution to improve the data availability is to create extra data copies. However, a common drawback of this solution is inefficient storage space utilization. This thesis aims to solve the efficient fault tolerance problem in distributed file systems. Our solution is expected to reduce the space cost while maintaining similar or higher data reliability of the whole system. To achieve the fault tolerance on distributed file systems, this thesis compares a certain number of erasure codes, including traditional Maximum Distance Separable (MDS) erasure codes and Low-Density Parity-Check (LDPC) erasure codes as alternatives. The algorithms to construct applicable erasure codes are presented and illustrated in this thesis. A simulator is developed for the simulation of data availability model with various parameter settings. Erasure codes construction is implemented in experiment. We evaluate the performance of our solutions according to the following performance metrics: encoding and decoding efficiency, storage space overhead and utilization, and data availability. These evaluations are completed through experiments in a practical environment as well as simulation. The experimental results demonstrate the validity and effectiveness of the proposed scheme. We have shown that an efficient fault tolerant scheme in distributed file systems can be achieved by applying erasure code technology. Compared to the previous MDS erasure codes such as Reed-Solomon Codes, the family of LDPC erasure codes meets the goal of enabling efficient fault tolerance in distributed file systems with an acceptable trade-off between the extra cost of encoding/decoding time and storage overhead.
Subjects/Keywords: distributed file system; erasure codes; fault tolerance; storage
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yu, L. (2011). Enabling Efficient Fault Tolerance in Distributed File Systems Through Erasure Codes. (Thesis). Oklahoma State University. Retrieved from http://hdl.handle.net/11244/8273
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Yu, Li. “Enabling Efficient Fault Tolerance in Distributed File Systems Through Erasure Codes.” 2011. Thesis, Oklahoma State University. Accessed December 14, 2019.
http://hdl.handle.net/11244/8273.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Yu, Li. “Enabling Efficient Fault Tolerance in Distributed File Systems Through Erasure Codes.” 2011. Web. 14 Dec 2019.
Vancouver:
Yu L. Enabling Efficient Fault Tolerance in Distributed File Systems Through Erasure Codes. [Internet] [Thesis]. Oklahoma State University; 2011. [cited 2019 Dec 14].
Available from: http://hdl.handle.net/11244/8273.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Yu L. Enabling Efficient Fault Tolerance in Distributed File Systems Through Erasure Codes. [Thesis]. Oklahoma State University; 2011. Available from: http://hdl.handle.net/11244/8273
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Cambridge
19.
Quintard, Julien.
Towards a worldwide storage infrastructure
.
Degree: 2012, University of Cambridge
URL: http://www.dspace.cam.ac.uk/handle/1810/243442
► Peer-to-peer systems have recently gained a lot of attention in the academic community especially through the design of KBR (Key-Based Routing) algorithms and DHT (Distributed…
(more)
▼ Peer-to-peer systems have recently gained a lot of attention in the academic
community especially through the design of KBR (Key-Based Routing) algorithms and DHT (Distributed Hash Table)s. On top of these
constructs were built promising applications such as video streaming applications but also storage infrastructures benefiting from the availability and resilience of such scalable network protocols.
Unfortunately, rare are the storage systems designed to be scalable and fault-tolerant to Byzantine behaviour, conditions required for such systems to be deployed in an environment such as the Internet. Furthermore, although some means of access control are often provided, such
file systems
fail to offer the end-users the flexibility required in order to easily manage the permissions granted to potentially hundreds or thousands of end-users. In addition, as for centralised
file systems which rely on a special user, referred to as root on Unices, distributed
file systems equally require some tasks to operate at the
system level. The decentralised nature of these systems renders impossible the use of a single authoritative entity for performing such tasks since implicitly granting her superprivileges, unacceptable configuration for such decentralised systems.
This thesis addresses both issues by providing the
file system objects a completely decentralised access control and administration scheme enabling users to express access control rules in a flexible way but also to request administrative tasks without the need for a superuser. A prototype has been developed and evaluated, proving feasible the deployment of such a
decentralised
file system in large-scale and untrustworthy environments.
Advisors/Committee Members: Bacon, Jean (advisor), Beresford, Alastair (advisor).
Subjects/Keywords: File system;
Peer-to-peer;
Decentralised;
Access control;
Administration;
Naming;
Byzantine
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Quintard, J. (2012). Towards a worldwide storage infrastructure
. (Thesis). University of Cambridge. Retrieved from http://www.dspace.cam.ac.uk/handle/1810/243442
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Quintard, Julien. “Towards a worldwide storage infrastructure
.” 2012. Thesis, University of Cambridge. Accessed December 14, 2019.
http://www.dspace.cam.ac.uk/handle/1810/243442.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Quintard, Julien. “Towards a worldwide storage infrastructure
.” 2012. Web. 14 Dec 2019.
Vancouver:
Quintard J. Towards a worldwide storage infrastructure
. [Internet] [Thesis]. University of Cambridge; 2012. [cited 2019 Dec 14].
Available from: http://www.dspace.cam.ac.uk/handle/1810/243442.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Quintard J. Towards a worldwide storage infrastructure
. [Thesis]. University of Cambridge; 2012. Available from: http://www.dspace.cam.ac.uk/handle/1810/243442
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Rochester
20.
Pearson, Jonathan.
Journaling filesystem consistency on disks without tagged
command queuing.
Degree: MS, 2008, University of Rochester
URL: http://hdl.handle.net/1802/5085
► A filesystem's sole purpose is to store data so it can be easily accessed at a later time. Part of that entails recovering properly from…
(more)
▼ A filesystem's sole purpose is to store data so it
can be easily accessed at a later time. Part of that entails
recovering properly from a system crash. But a difficulty that
modern filesystems face is the advent of write caching in a disk.
The disk will report that a write operation has completed before
the data is actually secure on the magnetic platter. How is a
programmer to respond to this outright lie from the hardware? The
problem goes even further. Journaled filesystems depend on the
order of the write operations they send to the disk. If the real
data is written before the journal, then there is not only no point
in having the journal, but it actually gives a false sense of
security. After a crash, the disk checker will only replay the
journal, never bothering to examine the real data on the disk for
consistency. There is a solution to this problem. It is called
Tagged Command Queuing (TCQ) in the SCSI-2 specification. And it is
optional. Filesystems, Ext3 in particular in this paper, use TCQ
exclusively and have no fallback. We present a fallback solution
that depends on a required feature of the SCSI-2 specification,
Force Unit Access (FUA). Our results showed that write-intensive
workloads display a significant slowdown from the FUA-based
solution. However, the performance impact is still less than that
incurred by using other methods, such as synchronizing the cache
after each journal write.
Subjects/Keywords: File system; Journaling; Data consistency
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Pearson, J. (2008). Journaling filesystem consistency on disks without tagged
command queuing. (Masters Thesis). University of Rochester. Retrieved from http://hdl.handle.net/1802/5085
Chicago Manual of Style (16th Edition):
Pearson, Jonathan. “Journaling filesystem consistency on disks without tagged
command queuing.” 2008. Masters Thesis, University of Rochester. Accessed December 14, 2019.
http://hdl.handle.net/1802/5085.
MLA Handbook (7th Edition):
Pearson, Jonathan. “Journaling filesystem consistency on disks without tagged
command queuing.” 2008. Web. 14 Dec 2019.
Vancouver:
Pearson J. Journaling filesystem consistency on disks without tagged
command queuing. [Internet] [Masters thesis]. University of Rochester; 2008. [cited 2019 Dec 14].
Available from: http://hdl.handle.net/1802/5085.
Council of Science Editors:
Pearson J. Journaling filesystem consistency on disks without tagged
command queuing. [Masters Thesis]. University of Rochester; 2008. Available from: http://hdl.handle.net/1802/5085
University of Toronto
21.
Huang, Wei.
UnityFS: A File System for the Unity Block Store.
Degree: 2013, University of Toronto
URL: http://hdl.handle.net/1807/42869
► A large number of personal cloud storage systems have emerged in recent years, such as Dropbox, iCloud, Google Drive etc. A common limitation of these…
(more)
▼ A large number of personal cloud storage systems have emerged in recent years, such as Dropbox, iCloud, Google Drive etc. A common limitation of these system is that the users have to trust the cloud provider not to be malicious. Now we have a Unity block store, which can solve the problem and provide a secure and durable cloud-based block store. However, the base Unity system does not have the concept of file on top of its block device, thus the concurrent operations to different files can cause false sharing problem. In this thesis, we propose UnityFS, a file system built on top of the base Unity system. We design and implement the file system that maintains a mapping between files and a group of data blocks, such that the whole Unity system can support concurrent file operations to different files from multiple user devices in the personal cloud.
MAST
Advisors/Committee Members: Lie, David, Electrical and Computer Engineering.
Subjects/Keywords: Distributed File System; Cloud Computing; Computer Security; 0984
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Huang, W. (2013). UnityFS: A File System for the Unity Block Store. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/42869
Chicago Manual of Style (16th Edition):
Huang, Wei. “UnityFS: A File System for the Unity Block Store.” 2013. Masters Thesis, University of Toronto. Accessed December 14, 2019.
http://hdl.handle.net/1807/42869.
MLA Handbook (7th Edition):
Huang, Wei. “UnityFS: A File System for the Unity Block Store.” 2013. Web. 14 Dec 2019.
Vancouver:
Huang W. UnityFS: A File System for the Unity Block Store. [Internet] [Masters thesis]. University of Toronto; 2013. [cited 2019 Dec 14].
Available from: http://hdl.handle.net/1807/42869.
Council of Science Editors:
Huang W. UnityFS: A File System for the Unity Block Store. [Masters Thesis]. University of Toronto; 2013. Available from: http://hdl.handle.net/1807/42869
University of Kentucky
22.
Nimmagadda, Rama Krishna.
A HIGHLY RELIABLE NON-VOLATILE FILE SYSTEM FOR SMALL SATELLITES.
Degree: 2008, University of Kentucky
URL: http://uknowledge.uky.edu/gradschool_theses/571
► Recent Advancements in Solid State Memories have resulted in packing several Giga Bytes (GB) of memory into tiny postage stamp size Memory Cards. Of late,…
(more)
▼ Recent Advancements in Solid State Memories have resulted in packing several Giga Bytes (GB) of memory into tiny postage stamp size Memory Cards. Of late, Secure Digital (SD) cards have become a de-facto standard for all portable handheld devices. They have found growing presence in almost all embedded applications, where huge volumes of data need to be handled and stored.
For the very same reason SD cards are being widely used in space applications also. Using these SD Cards in space applications requires robust radiation hardened SD cards and Highly Reliable Fault Tolerant File Systems to handle them. The present work is focused on developing a Highly Reliable Fault Tolerant SD card based FAT16 File System for space applications.
Subjects/Keywords: Secure Digital (SD); Multi Media Card (MMC); Fault Tolerant; File System; File Allocation Table (FAT); Electrical and Computer Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Nimmagadda, R. K. (2008). A HIGHLY RELIABLE NON-VOLATILE FILE SYSTEM FOR SMALL SATELLITES. (Masters Thesis). University of Kentucky. Retrieved from http://uknowledge.uky.edu/gradschool_theses/571
Chicago Manual of Style (16th Edition):
Nimmagadda, Rama Krishna. “A HIGHLY RELIABLE NON-VOLATILE FILE SYSTEM FOR SMALL SATELLITES.” 2008. Masters Thesis, University of Kentucky. Accessed December 14, 2019.
http://uknowledge.uky.edu/gradschool_theses/571.
MLA Handbook (7th Edition):
Nimmagadda, Rama Krishna. “A HIGHLY RELIABLE NON-VOLATILE FILE SYSTEM FOR SMALL SATELLITES.” 2008. Web. 14 Dec 2019.
Vancouver:
Nimmagadda RK. A HIGHLY RELIABLE NON-VOLATILE FILE SYSTEM FOR SMALL SATELLITES. [Internet] [Masters thesis]. University of Kentucky; 2008. [cited 2019 Dec 14].
Available from: http://uknowledge.uky.edu/gradschool_theses/571.
Council of Science Editors:
Nimmagadda RK. A HIGHLY RELIABLE NON-VOLATILE FILE SYSTEM FOR SMALL SATELLITES. [Masters Thesis]. University of Kentucky; 2008. Available from: http://uknowledge.uky.edu/gradschool_theses/571
The Ohio State University
23.
Noronha, Ranjit Mario.
Designing High-Performance And Scalable Clustered Network
Attached Storage With Infiniband.
Degree: PhD, Computer Science and Engineering, 2008, The Ohio State University
URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1218608130
► The Internet age has exponentially increased the volume of digital media that is being shared and distributed. Broadband Internet has made technologies such as…
(more)
▼ The Internet age has exponentially increased
the volume of digital media that is being shared and distributed.
Broadband Internet has made technologies such as high quality
streaming video on demand possible. Large scale supercomputers also
consume and create huge quantities of data. This media and data
must be stored, cataloged and retrieved with high-performance.
Researching high-performance storage subsystems to meet the I/O
demands of applications in modern scenarios is
crucial. Advances in microprocessor technology
have given rise to relatively cheap off-the-shelf hardware that may
be put together as personal computers as well as servers. The
servers may be connected together by networking technology to
create farms or clusters of workstations (COW). The evolution of
COWs has significantly reduced the cost of ownership of
high-performance clusters and has allowed users to build fairly
large scale machines based on commodity server
hardware. As COWs have evolved, networking
technologies like InfiniBand and 10 Gigabit Ethernet have also
evolved. These networking technologies not only give lower
end-to-end latencies, but also allow for better messaging
throughput between the nodes. This allows us to connect the
clusters with high-performance interconnects at a relatively lower
cost. With the deployment of low-cost,
high-performance hardware and networking technology, it is
increasingly becoming important to design a storage
system that can
be shared across all the nodes in the cluster. Traditionally, the
different components of the
file system have been stringed together
using network connections. The protocol generally used over the
network is TCP/IP. The TCP/IP protocol stack in general has been
shown to have poor performance especially for high-performance
networks. In this dissertation, we research the
problem of designing high-performance communication subsystems for
network attached storage (NAS) systems. Specifically, we delve into
the issues and potential solutions with designing communication
protocols for high-end single-server and clustered server NAS
systems. Orthogonally, we also investigate how a caching
architecture may potentially enhance the performance of a NAS
system. Finally, we look at the potential performance implications
of using some of these designs in two scenarios; over a long haul
network and when used as a basis for checkpointing parallel
applications.
Advisors/Committee Members: Dhabaleswar, Panda (Advisor).
Subjects/Keywords: Computer Science; Clusters; Networks; Computer Storage; InfiniBand; Clustered Storage; Network Attached Storage, NFS, Network File
Systems; pNFS; parallel network file system
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Noronha, R. M. (2008). Designing High-Performance And Scalable Clustered Network
Attached Storage With Infiniband. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1218608130
Chicago Manual of Style (16th Edition):
Noronha, Ranjit Mario. “Designing High-Performance And Scalable Clustered Network
Attached Storage With Infiniband.” 2008. Doctoral Dissertation, The Ohio State University. Accessed December 14, 2019.
http://rave.ohiolink.edu/etdc/view?acc_num=osu1218608130.
MLA Handbook (7th Edition):
Noronha, Ranjit Mario. “Designing High-Performance And Scalable Clustered Network
Attached Storage With Infiniband.” 2008. Web. 14 Dec 2019.
Vancouver:
Noronha RM. Designing High-Performance And Scalable Clustered Network
Attached Storage With Infiniband. [Internet] [Doctoral dissertation]. The Ohio State University; 2008. [cited 2019 Dec 14].
Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1218608130.
Council of Science Editors:
Noronha RM. Designing High-Performance And Scalable Clustered Network
Attached Storage With Infiniband. [Doctoral Dissertation]. The Ohio State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1218608130
Indian Institute of Science
24.
Yadwadkar, Neeraja.
Discovery Of Application Workloads From Network File Traces.
Degree: 2009, Indian Institute of Science
URL: http://hdl.handle.net/2005/1213
► An understanding of Input/Output data access patterns of applications is useful in several situations. First, gaining an insight into what applications are doing with their…
(more)
▼ An understanding of Input/Output data access patterns of applications is useful in several situations. First, gaining an insight into what applications are doing with their data at a semantic level helps in designing efficient storage systems. Second, it helps to create benchmarks that mimic realistic application behavior closely. Third, it enables autonomic systems as the information obtained can be used to adapt the
system in a closed loop.
All these use cases require the ability to extract the application-level semantics of I/O operations. Methods such as modifying application code to associate I/O operations with semantic tags are intrusive. It is well known that network
file system traces are an important source of information that can be obtained non-intrusively and analyzed either online or offline. These traces are a sequence of primitive
file system operations and their parameters. Simple counting, statistical analysis or deterministic search techniques are inadequate for discovering application-level semantics in the general case, because of the inherent variation and noise in realistic traces.
In this paper, we describe a trace analysis methodology based on Profile Hidden Markov Models. We show that the methodology has powerful discriminatory capabilities that enables it to recognize applications based on the patterns in the traces, and to mark out regions in a long trace that encapsulate sets of primitive operations that represent higher-level application actions. It is robust enough that it can work around discrepancies between training and target traces such as in length and interleaving with other operations. We demonstrate the feasibility of recognizing patterns based on a small sampling of the trace, enabling faster trace analysis. Preliminary experiments show that the method is capable of learning accurate profile models on live traces in an online setting. We present a detailed evaluation of this methodology in a UNIX environment using NFS traces of selected commonly used applications such as compilations as well as on industrial strength benchmarks such as TPC-C and Postmark, and discuss its capabilities and limitations in the context of the use cases mentioned above.
Advisors/Committee Members: Bhattacharyya, Chiranjib.
Subjects/Keywords: File Tracing (Computer Networks); Computer Communication; Profile Hidden Markov Models; Sequence Alignment; Network File System (NFS); Network File Traces; Hidden Markov Models (HMMs); Computer Science
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yadwadkar, N. (2009). Discovery Of Application Workloads From Network File Traces. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/1213
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Yadwadkar, Neeraja. “Discovery Of Application Workloads From Network File Traces.” 2009. Thesis, Indian Institute of Science. Accessed December 14, 2019.
http://hdl.handle.net/2005/1213.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Yadwadkar, Neeraja. “Discovery Of Application Workloads From Network File Traces.” 2009. Web. 14 Dec 2019.
Vancouver:
Yadwadkar N. Discovery Of Application Workloads From Network File Traces. [Internet] [Thesis]. Indian Institute of Science; 2009. [cited 2019 Dec 14].
Available from: http://hdl.handle.net/2005/1213.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Yadwadkar N. Discovery Of Application Workloads From Network File Traces. [Thesis]. Indian Institute of Science; 2009. Available from: http://hdl.handle.net/2005/1213
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Arkansas
25.
Nguyen, Hai Quang.
File System Simulation: Hierarchical Performance Measurement and Modeling.
Degree: PhD, 2011, University of Arkansas
URL: https://scholarworks.uark.edu/etd/111
► File systems are very important components in a computer system. File system simulation can help to predict the performance of new system designs. It…
(more)
▼ File systems are very important components in a computer
system.
File system simulation can help to predict the performance of new
system designs. It offers the advantages of the flexibility of modeling and the cost and time savings of utilizing simulation instead of full implementation. Being able to predict end-to-end
file system performance against a pre-defined workload can help
system designers to make decisions that could affect their entire product line, involving several million dollars of investment. This dissertation presents detailed simulation-based performance models of the Linux ext3
file system and the PVFS parallel
file system. The models are developed using Colored Petri Nets. A performance study, using the models, shows that the obtained results are close to the expected behavior of the real
file system. The model shows that
file system parameters have significant impact on the performance of the I/O when compared to the parameters of the disk subsystem.
Advisors/Committee Members: Amy Apon, Craig W. Thompson, Dale R. Thompson.
Subjects/Keywords: Applied sciences; Colored petri net; File system simulation; Hierachical performance; L2 cache model; Linux file system; Petri net; Computer Engineering; Electrical and Computer Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Nguyen, H. Q. (2011). File System Simulation: Hierarchical Performance Measurement and Modeling. (Doctoral Dissertation). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/111
Chicago Manual of Style (16th Edition):
Nguyen, Hai Quang. “File System Simulation: Hierarchical Performance Measurement and Modeling.” 2011. Doctoral Dissertation, University of Arkansas. Accessed December 14, 2019.
https://scholarworks.uark.edu/etd/111.
MLA Handbook (7th Edition):
Nguyen, Hai Quang. “File System Simulation: Hierarchical Performance Measurement and Modeling.” 2011. Web. 14 Dec 2019.
Vancouver:
Nguyen HQ. File System Simulation: Hierarchical Performance Measurement and Modeling. [Internet] [Doctoral dissertation]. University of Arkansas; 2011. [cited 2019 Dec 14].
Available from: https://scholarworks.uark.edu/etd/111.
Council of Science Editors:
Nguyen HQ. File System Simulation: Hierarchical Performance Measurement and Modeling. [Doctoral Dissertation]. University of Arkansas; 2011. Available from: https://scholarworks.uark.edu/etd/111
Brno University of Technology
26.
Pořízek, David.
Transparentní šifrování pro koncová zařízení
.
Degree: 2019, Brno University of Technology
URL: http://hdl.handle.net/11012/180427
► Cílem této práce je návrh a implementace řešení transparentního šifrování pro platformu Microsoft Windows. Řešení by mělo být propojitelné s produktem prevence proti úniku dat…
(more)
▼ Cílem této práce je návrh a implementace řešení transparentního šifrování pro platformu Microsoft Windows. Řešení by mělo být propojitelné s produktem prevence proti úniku dat (DLP) a rozšiřovat jej. K implementaci byl využit framework Microsoft
File System Minifilter Driver, s jehož pomocí je možné sledovat a upravovat přístup k jednotlivým souborům na externích zařízeních nebo discích za běhu systému. Soubory jsou zabezpečeny na pozadí tak, aby uživatel nebyl neovlivněn při práci. Ovladač zajišťuje, že uživatel vždy pracuje s rozšifrovanými daty. Dále bude také vyvinuta externí aplikace, která umožňuje uživateli přistoupit k zašifrovaným datům, aniž by musel být v síti, kde DLP produkt běží.; The goal of this thesis is to propose and implement a transparent encryption solution for the Microsoft Windows platform. The solution should be able to integrate with the data loss prevention (DLP) product and extend it. The implementation utilizes the Microsoft
File System Minifilter Driver framework, which allows it to monitor and modify access to files on an external device or a disk in a running
system. Protected files are encrypted in the background in order to not interfere with user's work. The driver ensures, that the user is always working with decrypted data. Furthermore, an external application will be developed, which will allow the user to access the protected files even in a network without the DLP product active.
Advisors/Committee Members: Kolář, Dušan (advisor).
Subjects/Keywords: transparentní šifrování;
šifrovací hlavička;
minifiltr;
file system;
ovladač;
windows driver model;
transparent encryption;
encryption header;
minifilter;
file system;
driver;
windows driver model
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Pořízek, D. (2019). Transparentní šifrování pro koncová zařízení
. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/180427
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Pořízek, David. “Transparentní šifrování pro koncová zařízení
.” 2019. Thesis, Brno University of Technology. Accessed December 14, 2019.
http://hdl.handle.net/11012/180427.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Pořízek, David. “Transparentní šifrování pro koncová zařízení
.” 2019. Web. 14 Dec 2019.
Vancouver:
Pořízek D. Transparentní šifrování pro koncová zařízení
. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2019 Dec 14].
Available from: http://hdl.handle.net/11012/180427.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Pořízek D. Transparentní šifrování pro koncová zařízení
. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/180427
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Kentucky
27.
Karumanchi, Sushama.
A TRUSTED STORAGE SYSTEM FOR THE CLOUD.
Degree: 2010, University of Kentucky
URL: http://uknowledge.uky.edu/gradschool_theses/22
► Data stored in third party storage systems like the cloud might not be secure since confidentiality and integrity of data are not guaranteed. Though cloud…
(more)
▼ Data stored in third party storage systems like the cloud might not be secure since confidentiality and integrity of data are not guaranteed. Though cloud computing provides cost-effective storage services, it is a third party service and so, a client cannot trust the cloud service provider to store its data securely within the cloud. Hence, many organizations and users may not be willing to use the cloud services to store their data in the cloud until certain security guarantees are made. In this thesis, a solution to the problem of securely storing the client’s data by maintaining the confidentiality and integrity of the data within the cloud is developed. Five protocols are developed which ensure that the client’s data is stored only on trusted storage servers, replicated only on trusted storage servers, and guarantee that the data owners and other privileged users of that data access the data securely. The system is based on trusted computing platform technology [11]. It uses a Trusted Platform Module, specified by the Trusted Computing Group [11]. An encrypted file system is used to encrypt the user’s data. The system provides data security against a system administrator in the cloud.
Subjects/Keywords: Trusted Storage; Cloud Computing; Trusted Platform; Encrypted File System; Cloud Storage; Computer Sciences
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Karumanchi, S. (2010). A TRUSTED STORAGE SYSTEM FOR THE CLOUD. (Masters Thesis). University of Kentucky. Retrieved from http://uknowledge.uky.edu/gradschool_theses/22
Chicago Manual of Style (16th Edition):
Karumanchi, Sushama. “A TRUSTED STORAGE SYSTEM FOR THE CLOUD.” 2010. Masters Thesis, University of Kentucky. Accessed December 14, 2019.
http://uknowledge.uky.edu/gradschool_theses/22.
MLA Handbook (7th Edition):
Karumanchi, Sushama. “A TRUSTED STORAGE SYSTEM FOR THE CLOUD.” 2010. Web. 14 Dec 2019.
Vancouver:
Karumanchi S. A TRUSTED STORAGE SYSTEM FOR THE CLOUD. [Internet] [Masters thesis]. University of Kentucky; 2010. [cited 2019 Dec 14].
Available from: http://uknowledge.uky.edu/gradschool_theses/22.
Council of Science Editors:
Karumanchi S. A TRUSTED STORAGE SYSTEM FOR THE CLOUD. [Masters Thesis]. University of Kentucky; 2010. Available from: http://uknowledge.uky.edu/gradschool_theses/22
28.
Wu, Xiaojian.
Storage Systems for Non-volatile Memory Devices.
Degree: 2011, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-9985
► This dissertation presents novel approaches to the use of non-volatile memory devices in building storage systems. There are many types of non-volatile memory devices, and…
(more)
▼ This dissertation presents novel approaches to the use of non-volatile memory devices in building storage systems. There are many types of non-volatile memory devices, and they usually have better performance than regular magnetic hard disks in terms of throughput and latency. This dissertation focused on two of them, NAND flash memory and Phase Change Memory (PCM). This work consisted of two parts.
The first part was to design a high-performance hybrid storage
system employing Solid State Drives that are build out of NAND flash memory and Hard Disk Drives. In this hybrid
system, we proposed two different policies to improve its performance. One is to exploit the fact that the performances of Solid State Drive and Hard Disk Drive are asymmetric and the other is to exploit concurrency on multiple devices. We implemented prototypes in Linux and evaluate both policies in multiple workloads and multiple configurations. The results showed that the proposed approaches improve the performance significantly, and adapt to different configurations of the
system under different workloads.
The second part was to implement a
file system on a special class of memory devices, Storage Class Memory (SCM), which is both byte addressable and also nonvolatile, e.g. PCM. We claimed that both the existing regular
file systems and the memory based
file systems are not suitable for SCM, and proposed a new
file system, called SCMFS, which is implemented on the virtual address space. In SCMFS, we utilized the existing memory management module in the operating
system to do the block management. Our design keeps address space within a
file contiguous to reduce the block management software. The simplicity of SCMFS not only makes it easy to implement, but also improves the performance. We implemented a prototype of SCMFS in Linux and evaluated its performance through multiple benchmarks.
Advisors/Committee Members: Reddy, A. L. Narasimha (advisor), Bettati, Riccardo (committee member), Savari, Serap (committee member), Shakkottai, Srinivas (committee member).
Subjects/Keywords: Storage; SSD; PCM; File System
…viii
CHAPTER
Page
2. File System Layout . . .
3. Space Pre-allocation . . .
4… …Modifications to Kernel .
5. Garbage Collection . . . .
6. File System Consistency .
C. Evaluation… …impact the performance of the whole system. File systems for PCM
should consider these factors… …chunk size of 64KB.
4. Impact of File System Metadata Placement
Previous research states that… …Flash and SSD . . . . . . . . . . . . .
Hybrid Storage System . . . . . . . . .
Data Migration…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wu, X. (2011). Storage Systems for Non-volatile Memory Devices. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-9985
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Wu, Xiaojian. “Storage Systems for Non-volatile Memory Devices.” 2011. Thesis, Texas A&M University. Accessed December 14, 2019.
http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-9985.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Wu, Xiaojian. “Storage Systems for Non-volatile Memory Devices.” 2011. Web. 14 Dec 2019.
Vancouver:
Wu X. Storage Systems for Non-volatile Memory Devices. [Internet] [Thesis]. Texas A&M University; 2011. [cited 2019 Dec 14].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-9985.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Wu X. Storage Systems for Non-volatile Memory Devices. [Thesis]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-9985
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
29.
Lundholm, Anders.
A performance comparison of ZFS and Btrfs on Linux.
Degree: Informatics, 2015, University of Skövde
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-10989
► In this thesis, the average throughput of Btrfs and ZFS on Linux is compared by conducting a set of experiments. Btrfs and ZFS are…
(more)
▼ In this thesis, the average throughput of Btrfs and ZFS on Linux is compared by conducting a set of experiments. Btrfs and ZFS are two enterprise-grade file systems that are designed with data integrity and scalability in mind and they bring numerous of other useful features as well. Btrfs is a relatively young file system whereas ZFS is more mature. However, the implementation of ZFS on the Linux platform was released only recently. The main conclusions that can be drawn from the analysis of the gathered data is that Btrfs has improved greatly in recent years and is today showing great throughput whereas ZFS on Linux is performing considerably worse than Btrfs.
Subjects/Keywords: linux; zfs; btrfs; file system; performance; average througput; Computer Sciences; Datavetenskap (datalogi)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lundholm, A. (2015). A performance comparison of ZFS and Btrfs on Linux. (Thesis). University of Skövde. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-10989
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Lundholm, Anders. “A performance comparison of ZFS and Btrfs on Linux.” 2015. Thesis, University of Skövde. Accessed December 14, 2019.
http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-10989.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Lundholm, Anders. “A performance comparison of ZFS and Btrfs on Linux.” 2015. Web. 14 Dec 2019.
Vancouver:
Lundholm A. A performance comparison of ZFS and Btrfs on Linux. [Internet] [Thesis]. University of Skövde; 2015. [cited 2019 Dec 14].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-10989.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Lundholm A. A performance comparison of ZFS and Btrfs on Linux. [Thesis]. University of Skövde; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-10989
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
NSYSU
30.
Lin, Shih-hung.
The Study of File Systems for Datacenter.
Degree: Master, Computer Science and Engineering, 2014, NSYSU
URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0630114-235025
► Storage system play an important role in computer architecture. In the era of big data, the demand of the capacity in storage is increasing. We…
(more)
▼ Storage
system play an important role in computer architecture. In the era of big data, the demand of the capacity in storage is increasing. We use 100 megabytes in the past, but now we can see hundreds of thousands of terabytes hard disks in the market. The big revolution in capacity, tell us people have big demand on storage space.
As the popularity of the Internet, people change their habit and put their work on Internet, Google Drive, iCloud and Dropbox is a good example here. In the backend of these service, is supported by the cluster
system. And now, the requirement of the cloud storage is growing.
In this thesis, we want to solve the storage problem for CCTV
system. We pick up some famous distributed
file system and other application of network
file system, just like GlusterFS, MooseFS, NFS and iSCSI. We focus on
system throughput and characteristic for comparison. Hope to find out the best
file system in this case and give reader a reference when choosing the
file system.
Advisors/Committee Members: Wen-Shyong Hsieh (chair), Jain-Shing Liu (chair), Shi-Huang Chen (chair), Cheng-Fu Chou (chair), Chun-Hung Lin (committee member).
Subjects/Keywords: XFS; GlusterFS; MooseFS; NFS; iSCSI; IOzone; Cluster Storage; File System; EXT4; Btrfs
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lin, S. (2014). The Study of File Systems for Datacenter. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0630114-235025
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Lin, Shih-hung. “The Study of File Systems for Datacenter.” 2014. Thesis, NSYSU. Accessed December 14, 2019.
http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0630114-235025.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Lin, Shih-hung. “The Study of File Systems for Datacenter.” 2014. Web. 14 Dec 2019.
Vancouver:
Lin S. The Study of File Systems for Datacenter. [Internet] [Thesis]. NSYSU; 2014. [cited 2019 Dec 14].
Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0630114-235025.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Lin S. The Study of File Systems for Datacenter. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0630114-235025
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
◁ [1] [2] [3] [4] [5] ▶
. 
Open Access Theses and Dissertations
