Relevant bibliographies by topics / Distributed Read-Write System

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Distributed Read-Write System'

Author: Grafiati
Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Distributed Read-Write System.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Distributed Read-Write System"

1

Lin, Ji-Cherng, Tetz C. Huang, Cheng-Zen Yang, and Nathan Mou. "Quasi-self-stabilization of a distributed system assuming read/write atomicity." Computers & Mathematics with Applications 57, no. 2 (January 2009): 184–94. http://dx.doi.org/10.1016/j.camwa.2008.02.052.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fan, Li Xian, Yong Zhao Xu, and Hong Tao Li. "Design and Realization of E-Learning Resource Storage System." Advanced Materials Research 271-273 (July 2011): 1307–12. http://dx.doi.org/10.4028/www.scientific.net/amr.271-273.1307.

Full text
Abstract:
The datacenter of one university owns massive E-Learning resources, and how to support safe and efficient access so as to support large-scale concurrent read and write protection has troubled the administrators of the campus datacenter. In this paper, we presented our E-learning resources storage system. The resources are stored in one HDFS(HADDOP Distributed File System) based storage systems, to effectively support the E-learning scenarios as small write-once files with large-scale concurrent read scenarios. Within the System, the E-learning data can be deployed redundantly across multiple storage nodes, which are distributed so as to improve read and write speed. Furthermore, when a single data node fails the system can also be recovered by redundant node data in the system and improve system security greatly. The system supports that the desktop systems, mobile platforms and web browser can access the system with cross-platform mechanism. The system adopts encryption mechanisms through the establishment of secure storage directory, and the user terminal can encrypts and unencrypts the user-files with offline mode to guarantee the safety of user data.
APA, Harvard, Vancouver, ISO, and other styles
3

Gao, Jintao, Wenjie Liu, and Zhanhuai Li. "A Strategy of Data Synchronization in Distributed System with Read Separating from Write." Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University 38, no. 1 (February 2020): 209–15. http://dx.doi.org/10.1051/jnwpu/20203810209.

Full text
Abstract:
Read separating from write is a strategy that NewSQL adopts to incorporate the advantages of traditional relation database and NoSQL database. Under this architecture, baseline data is split into multiple partitions stored at distributed physical nodes, while delta data is stored at single transaction node. For reducing the pressure of transaction node and improving the query performance, delta data needs to be synchronized into storage nodes. The current strategies trigger the procedure of data synchronization per partition, meaning that unchanged partitions will also participate in data synchronization, which consumes extra network cost, local IO and space resources. For improving the efficiency of data synchronization meanwhile mitigating space utilization, the fine-grained data synchronization strategy is proposed, whose main idea includes that fine-grained logical partitions upon original coarse-grained partitions is established, providing more correct synchronized unit; the delta data sensing strategy is introduced, which records the mapping between changed partitions and its delta data; instead of partition driven, the data synchronization through the delta-broadcasting mechanism is driven, constraining that only changed partitions can participate in data synchronization. The fine-grained data synchronization strategy on Oceanbase is implemented, which is a distributed database with read separating from write, and the results show that our strategy is better than other strategies in efficiency of data synchronizing and space utilization.
APA, Harvard, Vancouver, ISO, and other styles
4

Mardedi, Lalu Zazuli Azhar. "Analisa Kinerja System Gluster FS pada Proxmox VE untuk Menyediakan High Availability." MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer 19, no. 1 (November 5, 2019): 173–85. http://dx.doi.org/10.30812/matrik.v19i1.473.

Full text
Abstract:
Virtualization is used as a means to improve the scalability of existing hardware. Proxmox Virtual Environment (PVE) with hypervisor type based on open source. PVE can use Network Attached Storage as a network-based storage location in GlusterFS storage, which is a distributed file system. The research methodology uses Network Development Live Cycle (NDLC) which has 3 (three) stages, namely analysis, design, and simulation prototyping. The analysis phase is carried out by collecting data by means of literature study and data analysis. The design phase is carried out making the design of network systems and trials. At the simulation stage prototyping tests various scenarios and analyzes Read, Write and Re-Write tests. The system in PVE is integrated with GlusterFS storage made using two servers including the PVE 1 and PVE 2 servers. GlusterFS performance results show that the Read file capability is higher compared to Write, and Re-write in the measurement variations of 1mb, 10mb and 100mb files. In conclusion, GlusterFS can be clustered using the same node as PVE Cluster which can use GlusterFS as additional storage for PVE. GlusterFS also supports live migration features so that LXC or VM can do live migration from one node to another in an online state. The ability to write, re-write and read files on GlusterFS is also relatively stable in testing file size variations.
APA, Harvard, Vancouver, ISO, and other styles
5

Ahmad. "Data Replication Using Read-One-Write-All Monitoring Synchronization Transaction System in Distributed Environment." Journal of Computer Science 6, no. 10 (October 1, 2010): 1095–98. http://dx.doi.org/10.3844/jcssp.2010.1095.1098.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Jun, Changsen Pan, and Menghan Lu. "A Seismic Data Processing System based on Fast Distributed File System." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 14, no. 5 (April 6, 2015): 5779–88. http://dx.doi.org/10.24297/ijct.v14i5.3986.

Full text
Abstract:
Big data has attracted an increasingly number of attentions with the advent of the cloud era, and in the field of seismic exploration, the amount of data created by seismic exploration has also experienced an incredible growth in order to satisfy the social needs. In this case, it is necessary to build a highly-effective system of data storage and process. In our paper, we aim at the properties of the seismic data and the requirement to the performance of IO, and establish a distributed file system with the goal of processing seismic data based on the Fast Distributed File System (Fast DFS), then test our system through a series of operations such as file write and read, and the results show that our file system is very proper and effective when processing seismic data.
APA, Harvard, Vancouver, ISO, and other styles
7

MAT DERIS, MUSTAFA, ALI MAMAT, PUA CHAI SENG, and MOHD YAZID SAMAN. "THREE DIMENSIONAL GRID STRUCTURE FOR EFFICIENT ACCESS OF REPLICATED DATA." Journal of Interconnection Networks 02, no. 03 (September 2001): 317–29. http://dx.doi.org/10.1142/s0219265901000415.

Full text
Abstract:
This article addresses the performance of data replication protocol in terms of data availability and communication costs. Specifically, we present a new protocol called Three Dimensional Grid Structure (TDGS) protocol, to manage data replication in distributed system. The protocol provides high availability for read and write operations with limited fault-tolerance at low communication cost. With TDGS protocol, a read operation is limited to two data copies, while a write operation is required with minimal number of copies. In comparison to other protocols. TDGS requires lower communication cost for an operation, while providing higher data availability.
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Zijian, and Chuqiao Xiao. "ER-Store: A Hybrid Storage Mechanism with Erasure Coding and Replication in Distributed Database Systems." Scientific Programming 2021 (September 10, 2021): 1–13. http://dx.doi.org/10.1155/2021/9910942.

Full text
Abstract:
In distributed database systems, as cluster scales grow, efficiency and availability become critical considerations. In a cluster, a common approach to high availability is using replication, but this is inefficient due to its low storage utilization. Erasure coding can provide data reliability while ensuring high storage utilization. However, due to the large number of coding and decoding operations required by the CPU, it is not suitable for some frequently updated data. In order to optimize the storage efficiency of the data in the distributed system without affecting the availability of the data, this paper proposes a data temperature recognition algorithm that can distinguish data tablets and divides data tablets into three types, cold, warm, and hot, according to the frequency of access. Combining three replicas and erasure coding technology, ER-store is proposed, a hybrid storage mechanism for different data types. At the same time, we combined the read-write separation architecture of the distributed database system to design the data temperature conversion cycle, which reduces the computational overhead caused by frequent updates of erasure coding technology. We have implemented this design on the CBase database system based on the read-write separation architecture, and the experimental results show that it can save 14.6%–18.3% of the storage space while meeting the efficient access performance of the system.
APA, Harvard, Vancouver, ISO, and other styles
9

Zain ali, Zain ali. "The Communication Mechanism in a Distributed System." International Journal for Electronic Crime Investigation 5, no. 3 (April 6, 2022): 17–22. http://dx.doi.org/10.54692/ijeci.2022.050385.

Full text
Abstract:
In this research, problems are discussed dynamically distributed systems that relate to the sharing of data and communication from one system to another over the network. A distributed system communicates with its related systems by sending and receiving messages over the internet and in this way, it fulfills its work. When we discuss dynamic distributed systems, it means that it includes many different changeable types of networks, different operating systems like android, mac, windows, different software processors portability, breaking down of WAN, and inter-process communication errors. Another problem that accrues in distributed systems is latency. So, it is very difficult to develop software for these types of environments. Proposed work is related to make message communication in distributed systems easy, reliable, and efficient. For the sharing of data, coherence is responsible. Every problem can be solved but that proper appropriate methods and algorithms are required. We create a new method which is a dynamic atomic shared memory for message communication. A properly stated method is proposed for message communication and then implemented. According to this method, owners can be changed dynamically and their access to read and write also changes.
APA, Harvard, Vancouver, ISO, and other styles
10

Noor, Ahmad Shukri Mohd, Nur Farhah Mat Zian, and Fatin Nurhanani M. Shaiful Bahri. "Survey on replication techniques for distributed system." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 2 (April 1, 2019): 1298. http://dx.doi.org/10.11591/ijece.v9i2.pp1298-1303.

Full text
Abstract:
<p>Distributed systems mainly provide access to a large amount of data and computational resources through a wide range of interfaces. Besides its dynamic nature, which means that resources may enter and leave the environment at any time, many distributed systems applications will be running in an environment where faults are more likely to occur due to their ever-increasing scales and the complexity. Due to diverse faults and failures conditions, fault tolerance has become a critical element for distributed computing in order for the system to perform its function correctly even in the present of faults. Replication techniques primarily concentrate on the two fault tolerance manners precisely masking the failures as well as reconfigure the system in response. This paper presents a brief survey on different replication techniques such as Read One Write All (ROWA), Quorum Consensus (QC), Tree Quorum (TQ) Protocol, Grid Configuration (GC) Protocol, Two-Replica Distribution Techniques (TRDT), Neighbour Replica Triangular Grid (NRTG) and Neighbour Replication Distributed Techniques (NRDT). These techniques have its own redeeming features and shortcoming which forms the subject matter of this survey.</p>
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Distributed Read-Write System"

1

Saraswathy, RM. "Optimal Redundancy in Distributed Systems for Latency and Repair." Thesis, 2021. https://etd.iisc.ac.in/handle/2005/5542.

Full text
Abstract:
Distributed systems are employed in many modern storage and computing architecture for greater reliability and cost-efficiency. There are several important considerations in the design and implementation of such distributed systems, such as latency, availability, storage cost, among others. We look into the interplay between redundancy and the parameters, latency and repair for the design of such systems. Data is replicated and stored redundantly over multiple servers for availability in distributed databases. In this thesis, we first study the impact of redundancy on system latency in distributed databases. We focus on databases with frequent reads and writes, where both read and write latencies are important. This is in contrast to databases designed primarily for either read or write applications. Redundancy has contrasting effects on read and write latency. Read latency can be reduced by potential parallel access from multiple servers, whereas write latency increases as a larger number of replicas have to be updated. We quantify this tradeoff between read and write latency as a function of redundancy and provide a closed-form approximation when the request arrival is Poisson and the service is memoryless. We empirically show that this approximation is tight across all ranges of system parameters. Thus, we provide guidelines for redundancy selection in distributed databases. Further, we demonstrate the existence of optimal redundancy even in systems with non-memoryless service through simulations and experiments on practical systems. Secondly, we propose a redundant scheme that introduces repair locality in distributed computation. In contrast to the previous model, we consider performing computations other than simple read and write across the distributed system. In distributed computing, a computation job is split into multiple tasks, and the tasks are executed over multiple nodes. In such a setting, slow compute nodes, referred to as stragglers, pose a bottleneck on the job computation time. For distributed computing of multivariate polynomials, Lagrange coded computing (LCC) proposed in literature tolerates an optimal number of stragglers while providing security against adversaries. Introducing repair locality in this setting reduces the number of worker nodes contacted to recover a particular computation and allows clients/intermediate nodes to compute individual function outputs. We propose a distributed polynomial computing scheme, where data is encoded using Tamo-Barg codes with carefully chosen parameters. We show that the scheme tolerates a larger number of stragglers when compared to the repeated LCC and Product Lagrange coded schemes for certain parameters. Furthermore, we provide an alternate proof for the optimality of LCC for multilinear functions based on properties of multivariate polynomial interpolation.
APA, Harvard, Vancouver, ISO, and other styles
2

Arpith, K. "IO Pattern Aware Methods to Improve the Performance and Lifetime of NAND SSD." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/5376.

Full text
Abstract:
Modern SSDs can store multiple bits per transistor which enables it to have higher storage capacities. Low cost per bit of such SSDs has made it a commercial success. As of 2018, cells with an ability to store three bits are being widely used, with Intel and Micron just announcing even the availability of the first commercial SSD with quad level cells. However, such high-density SSDs suffer from longer latencies to write and read data, resulting in reduced throughputs, when compared to ash memories that store a single bit per cell. Also, they suffer from reduced reliability. Mechanisms to detect bit errors and prevent data loss add to performance overheads. In this thesis, we propose two system-level solutions, that use the knowledge of IO patterns of the workload to improve the performance and lifetime of NAND based solid state drives. The first part of the work proposes to combine various page types in a wordline to a single logical page called a Melded-Page. This improves the read performance of an SSD by mitigating the overheads involved in the read operation. Using this method, we achieve performance improvements of up to 44% on distributed workloads that use Hadoop Distributed File System (HDFS). Second, to improve the write performance and lifetime of an SSD, we propose a modifi ed programming scheme called Hot Page Aware Relaxed Program Sequence scheme. Constraints are put in place to ensure that a lower signi ficant bit is invalidated before programming a higher signi ficant bit. Experimental results show an average improvement of 56% in the performance of the SSD when compared to the existing program sequence scheme. We also observe a reduction in the number of pages backed up by an average of 85%. When compared to methods that use dynamic SLCs, the proposed scheme can reduce the number of block-erases by an average of 61%.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Distributed Read-Write System"

1

Raynal, Michel. "The Read/Write Register Abstraction." In Fault-Tolerant Message-Passing Distributed Systems, 77–94. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94141-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Raynal, Michel, and Jiannong Cao. "Anonymity in Distributed Read/Write Systems: An Introductory Survey." In Networked Systems, 122–40. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-05529-5_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Raynal, Michel. "Atomic Read/Write Registers in the Presence of Byzantine Processes." In Fault-Tolerant Message-Passing Distributed Systems, 155–70. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94141-7_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Raynal, Michel. "A Broadcast Abstraction Suited to the Family of Read/Write Implementable Objects." In Fault-Tolerant Message-Passing Distributed Systems, 131–53. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94141-7_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Raynal, Michel. "Circumventing the t < n/2 Read/Write Register Impossibility: the Failure Detector Approach." In Fault-Tolerant Message-Passing Distributed Systems, 119–29. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94141-7_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Raynal, Michel. "Building Read/Write Registers Despite Asynchrony and Less than Half of Processes Crash (t < n/2)." In Fault-Tolerant Message-Passing Distributed Systems, 95–117. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94141-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Patra, Prashant Kumar, and Padma Lochan Pradhan. "Dynamic FCFS ACM Model for Risk Assessment on Real Time Unix File System." In Transportation Systems and Engineering, 551–71. IGI Global, 2015. http://dx.doi.org/10.4018/978-1-4666-8473-7.ch027.

Full text
Abstract:
The access control is a mechanism that a system grants, revoke the right to access the object. The subject and object can able to integrate, synchronize, communicate and optimize through read, write and execute over a UFS. The access control mechanism is the process of mediating each and every request to system resources, application and data maintained by a operating system and determining whether the request should be approve, created, granted or denied as per top management policy. The AC mechanism, management and decision is enforced by implementing regulations established by a security policy. The management has to investigate the basic concepts behind access control design and enforcement, point out different security requirements that may need to be taken into consideration. The authors have to formulate and implement several ACM on normalizing and optimizing them step by step, that have been highlighted in proposed model for development and production purpose. This research paper contributes to the development of an optimization model that aims and objective to determine the optimal cost, time and maximize the quality of services to be invested into security model and mechanisms deciding on the measure components of UFS. This model has to apply to ACM utilities over a Web portal server on object oriented and distributed environment. This ACM will be resolve the uncertainty, un-order, un formal and unset up (U^4) problems of web portal on right time and right place of any where & any time in around the globe. It will be more measurable and accountable for performance, fault tolerance, throughput, bench marking and risk assessment on any application.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Distributed Read-Write System"

1

Monen, Marinus J. "Distributed Digital Servo." In Symposium on Optical Memory. Washington, D.C.: Optica Publishing Group, 1996. http://dx.doi.org/10.1364/isom.1996.otua.3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Krishna, Talluri Lakshmi Siva Rama, Thirumalaisamy Ragunathan, and Sudheer Kumar Battula. "Performance Evaluation of Read and Write Operations in Hadoop Distributed File System." In 2014 Sixth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP). IEEE, 2014. http://dx.doi.org/10.1109/paap.2014.49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hać, Anna. "On the modeling of read and write locks on a distributed system." In the 1985 ACM thirteenth annual conference. New York, New York, USA: ACM Press, 1985. http://dx.doi.org/10.1145/320599.320718.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dewan, Hrishikesh, and Ramesh C. Hansdah. "Julunga: A New Large-Scale Distributed Read-Write File Storage System for Cloud Computing Environments." In 2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA). IEEE, 2018. http://dx.doi.org/10.1109/aina.2018.00138.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ramanathan, Saraswathy, Gaurav Gautam, Vikram Srinivasan, and Parimal Parag. "Latency-Redundancy Tradeoff in Distributed Read-Write Systems." In 2022 14th International Conference on COMmunication Systems & NETworkS (COMSNETS). IEEE, 2022. http://dx.doi.org/10.1109/comsnets53615.2022.9668414.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gu, Wenhao, Xuchao Xie, Wei Zhang, and Dezun Dong. "A Transformable NVMeoF Queue Design for Better Differentiating Read and Write Request Processing." In 2022 IEEE 28th International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2023. http://dx.doi.org/10.1109/icpads56603.2022.00077.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mostefaoui, Achour, and Michel Raynal. "Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems." In PODC '16: ACM Symposium on Principles of Distributed Computing. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2933057.2933095.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Distributed Read-Write System' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography