Relevant bibliographies by topics / Distributed register

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Distributed register'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 May 2024

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 register.'

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 register"

1

Khuzmiev, Izmail Kaurbekovich, Dmitry Vasilievich Reisikh, and Olga Izmailovna Gassieva. "DISTRIBUTED ENERGY GETNET REGISTER TECHNOLOGY." Теоретическая экономика, no. 9 (2021): 37–48. http://dx.doi.org/10.52957/22213260_2021_9_37.

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

Maolin Guan, Chunyuan Zhang, and Nan Wu. "Register File Load Balanced VLIW Scheduling for Distributed Register Files." International Journal of Advancements in Computing Technology 5, no. 3 (February 15, 2013): 61–70. http://dx.doi.org/10.4156/ijact.vol5.issue3.8.

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

Danіch, V., and R. Lutsenko. "Virtual assets of the distributed register." Bulletin of V. N. Karazin Kharkiv National University Economic Series, no. 104 (June 30, 2023): 5–10. http://dx.doi.org/10.26565/2311-2379-2023-104-01.

Full text
Abstract:
This publication focuses on the definition of “virtual assets of a distributed registry” as an economic category. Analysis of the term showed a lack of unity in the definition. The opportunities provided by the deployment of virtual assets in a distributed registry are new but potentially effective. Virtual assets can be distributed or unallocated registry assets, secured or unsecured. Among the virtual assets of the distributed ledger: tokenized assets and cryptocurrencies. Accordingly, these are types of virtual assets that exist exclusively in the form of a record with an information identifier. But in the case of a tokenized asset, this information is derived from the original asset. And in the case of a crypto asset, this information is not derived from the primary asset. The stakeholders of the virtual assets market are individuals, miners, mining pools, which carry out the storage, exchange, transfer, provision of intermediary services. Disadvantages of the introduction of virtual assets of the distributed register are the possibility of anonymous transfers, complicated process of identification of stakeholders in the virtual assets market, the possibility of financial speculation, money laundering, difficulties with taxation. The advantages include relatively low transaction fees, their irreversibility and rapid validation. Any changes to the data in the chain of blocks are possible only when stakeholders confirm the legitimacy of transactions in accordance with general rules and protocols. This technology prevents data loss because all network members keep an up-to-date, up-to-date copy in encrypted form. The use of blockchain eliminates the possibility of making changes to the data, so the database is considered relevant at the time of access. Data is stored on different servers, data cannot be processed with expired dates, changes are made in real time and it is impossible to forge them. It is noted that the introduction of virtual assets of the distributed register in order to stimulate economic growth requires a joint effort of the science sector, education sector, IT sector, financial sector, the sector of state regulators. The possibilities of distribution register technologies are constantly growing and opening new perspectives.
APA, Harvard, Vancouver, ISO, and other styles
4

Lu, Chia-Han, Wen-Li Shih, Chung-Ju Wu, and Jenq Kuen Lee. "Achieving spilling-friendly register file assignment for highly distributed register files." Journal of Supercomputing 69, no. 3 (August 22, 2014): 1342–62. http://dx.doi.org/10.1007/s11227-014-1181-2.

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

Etuh, Emmanuel, Umar Zayyanu, and Onyebuchi Destiny Jacob. "A Structural Framework for Distributed Electronic Voters Register." Journal of Information 5, no. 1 (2019): 27–38. http://dx.doi.org/10.18488/journal.104.2019.51.27.38.

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

Milenković, Aleksandar, Dragan Janković, Anđelija Đorđević, Aleksandar Spasić, and Petar Rajković. "REALIZATION OF DISTRIBUTED MEDICAL DATA REPOSITORY IN AN ENVIRONMENT WITH HETEROGENOUS MIS." Facta Universitatis, Series: Automatic Control and Robotics 20, no. 3 (December 18, 2021): 135. http://dx.doi.org/10.22190/fuacr210930011m.

Full text
Abstract:
The introduction of centralized registers of medical data after a long time from the implementation of medical information systems and their long-term daily operation is a very challenging and demanding process. In this paper, three ways for the realization of centralized repositories of medical data are considered, and on that occasion, the advantages and limitations of these solutions are emphasized. Due to the heterogeneity of medical information systems in terms of technologies used and implementation, the construction of a distributed centralized national register of medical data emerges as a good solution. A proposal of architecture for the realization of the distributed central republic register of medical data is given. As an example of the proposed solution, the realized collaboration of the central republic radiological information system and its implementation with the medical information system MEDIS.NET is presented.
APA, Harvard, Vancouver, ISO, and other styles
7

Fujiwara, Koichi, Kazushi Kawamura, Masao Yanagisawa, and Nozomu Togawa. "An FPGA Implementation Method based on Distributed-register Architectures." IPSJ Transactions on System LSI Design Methodology 12 (2019): 38–41. http://dx.doi.org/10.2197/ipsjtsldm.12.38.

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

Maksudova, L. G., and T. V. Mastavichene. "Distributed register systems in the information technology of cadasters." Geodesy and Aerophotosurveying 62, no. 2 (2018): 173–78. http://dx.doi.org/10.30533/0536-101x-2018-62-2-173-178.

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

Seok Chang Kim and Byeong Gi Lee. "Synchronization of shift register generators in distributed sample scramblers." IEEE Transactions on Communications 42, no. 2/3/4 (February 1994): 1400–1408. http://dx.doi.org/10.1109/tcomm.1994.580248.

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

Lim, K. H., Y. H. Kim, and T. Kim. "Interconnect and communication synthesis for distributed register-file microarchitecture." IET Computers & Digital Techniques 3, no. 2 (2009): 162. http://dx.doi.org/10.1049/iet-cdt:20080019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Distributed register"

1

Bunchua, Santithorn. "Fully Distributed Register Files for Heterogeneous Clustered Microarchitectures." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/5041.

Full text
Abstract:
Conventional processor design utilizes a central register file and a bypass network to deliver operands to and from functional units, which cannot scale to a large number of functional units. As more functional units are integrated into a processor, the number of ports on a register file grows linearly while area, delay, and energy consumption grow even more rapidly. Physical properties of a bypass network scale in a similar manner. In this dissertation, a fully distributed register file organization is presented to overcome this limitation by relying on small register files with fewer ports and localized operand bypasses. Unlike other clustered microarchitectures, each cluster features a small single-issue functional unit coupled with a small local register file. Several clusters are used, and each of them can be different. All register files are connected through a register transfer network that supports multicast communications. Techniques to support distributed register file operations are presented for both dynamically and statically scheduled processors. These include the eager and multicast register transfer mechanisms in the dynamic approach and the global data routing with multicasting algorithm in the static approach. Although this organizaiton requires additional cycles to execute a program, it is compensated by significant savings obtained through smaller area, faster operand access time, and lower energy consumption. With faster operating frequency and more efficient hardware implementation, overall performance can be improved. Additionally, the fully distributed register file organization is applied to an ILP-SIMD processing element, which is the major building block of a massively parallel media processor array. The results show reduction in die area, which can be utilized to implement additional processing elements. Consequently, performance is improved through a higher degree of data parallelism through a larger processor array. In summary, the fully distributed register file architecture permits future processors to scale to a large number of functional units. This is especially desirable in high-throughput processors such as wide-issue processors and multithreaded processors. Moreover, localized communication is highly desirable in the transition to future deep submicron technologies since long wire is a critical issue in processes with extremely small feature sizes.
APA, Harvard, Vancouver, ISO, and other styles
2

Del, Pozzo Antonella. "Building distributed computing abstractions in the presence of mobile byzantine failures." Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066159/document.

Full text
Abstract:
Dans cette thèse on s’intéresse à un modèle de faute Byzantins Mobiles. Jusqu’à présent, seulement le problème du Consensus a été résolu en présente de faute Byzantines Mobiles et plusieurs variations de ce modèle de faute ont été proposé. Pour chacun de ces modelés ont été prouvées les bornes inferieures du nombre de processus correct nécessaire et des solutions asymptotiquement optimales ont été proposées. Notre première contribution porte sur les registres repartis dans ce modèle. Les registres repartis sont l’abstraction à la base du stockage reparti. Ces résultats préconisent donc notre deuxième contribution principale, un modèle de faute Byzantine Mobile généralisé. Notre troisième contribution est un ensemble de preuves de nécessité et d’impossibilité pour les registres repartis dans ces modèles. En particulier on prouve qu’il n’est pas possible d’implémenter la spécification plus faible des registres dans un système asynchrone. Par contre, pour les systèmes synchrones, on prouve des bornes inferieures et propose des protocoles asymptotiquement optimaux pour le registrer régulier. Pour conclure, notre dernière contribution porte sur le problème d’accord approximé, une forme affaiblie du consensus. On résout ce problème dans le modèle basé sur ronde, le même du consensus. En outre, il est intéressant de noter qua dans le modèle statique, la borne inferieure sur le nombre de répliques est la même pour le consensus et pour le problème d’accord approximé. Le même invariant s’applique avec les fautes byzantine mobiles. De plus, on accompagne ces bornes inferieures avec une solution asymptotiquement optimale pour le problème d’accord approximé
In this thesis we consider a model where Byzantine failures are not fixed, we consider the so called Mobile Byzantine failures. So far, only Consensus problem has been solved in presence of Mobile Byzantine failures and interestingly different variations of this failure model have been proposed. For each of them have been proved lower bounds on the number of required processes and have been proposed tight solutions. Our first contribution concerns distributed Registers in such strong model. Distributed Registers are the basic abstraction for Distributed Storages. This advocates our second and main contribution, a general Mobile Byzantine Failure Model. Our main focus is about Distributed Registers, so our third contribution comes, we prove necessities and impossibilities in those models. In particular we prove that is it not possible to solve the weakest register specification in an asynchronous system. On the other side we prove lower bounds for the synchronous system, with respect to the proposed hierarchy models, and tight protocols to solve the Regular Register problem. To conclude, our last contribution is about the Approximate Agreement problem, a weaker form of Consensus. We solve such problem in the same round-based models as Consensus so far. The interesting result is the following, in presence of static Byzantine failures, lower bounds on the number of correct replicas does not change between consensus and approximate agreement. The same invariant still holds in presence of Mobile Byzantine failure. Moreover, along with lower bounds we propose a tight solution to solve approximate agreement
APA, Harvard, Vancouver, ISO, and other styles
3

Bonnin, David. "Algorithmique distribuée asynchrone avec une majorité de pannes." Thesis, Bordeaux, 2015. http://www.theses.fr/2015BORD0264/document.

Full text
Abstract:
En algorithmique distribuée, le modèle asynchrone par envoi de messages et à pannes est connu et utilisé dans de nombreux articles de par son réalisme,par ailleurs il est suffisamment simple pour être utilisé et suffisamment complexe pour représenter des problèmes réels. Dans ce modèle, les n processus communiquent en s'échangeant des messages, mais sans borne sur les délais de communication, c'est-à-dire qu'un message peut mettre un temps arbitrairement long à atteindre sa destination. De plus, jusqu'à f processus peuvent tomber en panne, et ainsi arrêter définitivement de fonctionner. Ces pannes indétectables à cause de l'asynchronisme du système limitent les possibilités de ce modèle. Dans de nombreux cas, les résultats connus dans ces systèmes sont limités à une stricte minorité de pannes. C'est par exemple le cas de l'implémentation de registres atomiques et de la résolution du renommage. Cette barrière de la majorité de pannes, expliquée par le théorème CAP, s'applique à de nombreux problèmes, et fait que le modèle asynchrone par envoi de messages avec une majorité de pannes est peu étudié. Il est donc intéressant d'étudier ce qu'il est possible de faire dans ce cadre.Cette thèse cherche donc à mieux comprendre ce modèle à majorité de pannes, au travers de deux principaux problèmes. Dans un premier temps, on étudie l'implémentation d'objets partagés similaires aux registres habituels, en définissant les bancs de registres x-colorés et les α-registres. Dans un second temps, le problème du renommage est étendu en renommage k-redondant, dans ses versions à-un-coup et réutilisable, et de même pour les objets partagés diviseurs, étendus en k-diviseurs
In distributed computing, asynchronous message-passing model with crashes is well-known and considered in many articles, because of its realism and it issimple enough to be used and complex enough to represent many real problems.In this model, n processes communicate by exchanging messages, but withoutany bound on communication delays, i.e. a message may take an arbitrarilylong time to reach its destination. Moreover, up to f among the n processesmay crash, and thus definitely stop working. Those crashes are undetectablebecause of the system asynchronism, and restrict the potential results in thismodel.In many cases, known results in those systems must verify the propertyof a strict minority of crashes. For example, this applies to implementationof atomic registers and solving of renaming. This barrier of a majority ofcrashes, explained by the CAP theorem, restricts numerous problems, and theasynchronous message-passing model with a majority of crashes is thus notwell-studied and rather unknown. Hence, studying what can be done in thiscase of a majority of crashes is interesting.This thesis tries to analyse this model, through two main problems. The first part studies the implementation of shared objects, similar to usual registers,by defining x-colored register banks, and α-registers. The second partextends the renaming problem into k-redundant renaming, for both one-shotand long-lived versions, and similarly for the shared objects called splitters intok-splitters
APA, Harvard, Vancouver, ISO, and other styles
4

Del, Pozzo Antonella. "Building distributed computing abstractions in the presence of mobile byzantine failures." Electronic Thesis or Diss., Paris 6, 2017. http://www.theses.fr/2017PA066159.

Full text
Abstract:
Dans cette thèse on s’intéresse à un modèle de faute Byzantins Mobiles. Jusqu’à présent, seulement le problème du Consensus a été résolu en présente de faute Byzantines Mobiles et plusieurs variations de ce modèle de faute ont été proposé. Pour chacun de ces modelés ont été prouvées les bornes inferieures du nombre de processus correct nécessaire et des solutions asymptotiquement optimales ont été proposées. Notre première contribution porte sur les registres repartis dans ce modèle. Les registres repartis sont l’abstraction à la base du stockage reparti. Ces résultats préconisent donc notre deuxième contribution principale, un modèle de faute Byzantine Mobile généralisé. Notre troisième contribution est un ensemble de preuves de nécessité et d’impossibilité pour les registres repartis dans ces modèles. En particulier on prouve qu’il n’est pas possible d’implémenter la spécification plus faible des registres dans un système asynchrone. Par contre, pour les systèmes synchrones, on prouve des bornes inferieures et propose des protocoles asymptotiquement optimaux pour le registrer régulier. Pour conclure, notre dernière contribution porte sur le problème d’accord approximé, une forme affaiblie du consensus. On résout ce problème dans le modèle basé sur ronde, le même du consensus. En outre, il est intéressant de noter qua dans le modèle statique, la borne inferieure sur le nombre de répliques est la même pour le consensus et pour le problème d’accord approximé. Le même invariant s’applique avec les fautes byzantine mobiles. De plus, on accompagne ces bornes inferieures avec une solution asymptotiquement optimale pour le problème d’accord approximé
In this thesis we consider a model where Byzantine failures are not fixed, we consider the so called Mobile Byzantine failures. So far, only Consensus problem has been solved in presence of Mobile Byzantine failures and interestingly different variations of this failure model have been proposed. For each of them have been proved lower bounds on the number of required processes and have been proposed tight solutions. Our first contribution concerns distributed Registers in such strong model. Distributed Registers are the basic abstraction for Distributed Storages. This advocates our second and main contribution, a general Mobile Byzantine Failure Model. Our main focus is about Distributed Registers, so our third contribution comes, we prove necessities and impossibilities in those models. In particular we prove that is it not possible to solve the weakest register specification in an asynchronous system. On the other side we prove lower bounds for the synchronous system, with respect to the proposed hierarchy models, and tight protocols to solve the Regular Register problem. To conclude, our last contribution is about the Approximate Agreement problem, a weaker form of Consensus. We solve such problem in the same round-based models as Consensus so far. The interesting result is the following, in presence of static Byzantine failures, lower bounds on the number of correct replicas does not change between consensus and approximate agreement. The same invariant still holds in presence of Mobile Byzantine failure. Moreover, along with lower bounds we propose a tight solution to solve approximate agreement
APA, Harvard, Vancouver, ISO, and other styles
5

Martiš, Viktor. "Návrh distribuovaného systému pro zpracování školní matriky ZŠ, SŠ, VOŠ." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2009. http://www.nusl.cz/ntk/nusl-236735.

Full text
Abstract:
One of the software success condition on the software market is permanent development to keep in condition with actual technical tools. That is the reason why SAS software is searching for a way how to fulfil customer's requirements better. The change to the distributed system architecture brings new opportunities and sets up competitive advantage for SAS concurrently. The subject of this thesis is to create the design of movement to the distributed system. The main reason is to make analysis, design and partial implementation meeting functional requirements of the new architecture.
APA, Harvard, Vancouver, ISO, and other styles
6

Giansante, Cesare. "Ricerca su Registri Distribuiti: un Approccio Basato su Distributed Hash Tables." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/22887/.

Full text
Abstract:
In questo lavoro di tesi viene proposta e realizzata una Distributed Hash Table (DHT). Una Distributed Hash Table è un sistema di archiviazione decentralizzato che fornisce schemi di ricerca e archiviazione simili a una tabella hash, permettendo la memorizzazione di dati sotto forma di coppie chiave-valore. Gestisce i dati distribuendoli su un numero di nodi e implementando uno schema di routing che consente di cercare in modo efficiente il nodo su cui si trova l’elemento della ricerca. La caratteristica della DHT realizzata è quella di avere una struttura ad ipercubo. È stato utilizzato un simulatore, PeerSim, con il quale è stato possibile simulare la rete di nodi su cui si appoggia la DHT. Lo scopo di questo strumento è quello di permettere a chiunque lo utilizzi, di cercare in maniera facile e veloce dei dati specifici. Questo è permesso grazie all’implementazione del meccanismo di ricerca basato su keywords. Il lavoro proposto fa parte di una ricerca più ampia, la quale, mira a realizzare un'architettura di sistema per promuovere lo sviluppo di sistemi di trasporto intelligenti (ITS) utilizzando registri distribuiti e tecnologie correlate. Saranno implementate due tipologie di ricerca e, infine, verranno eseguiti dei test per valutare l’efficienza di queste operazioni. Lo scopo è quello di constatare quanto sia efficiente il meccanismo di routing implementato, andando ad analizzare il rapporto tra il numero dei nodi della rete e il numero degli scambi di informazione tra i vari nodi necessario per completare una richiesta di ricerca.
APA, Harvard, Vancouver, ISO, and other styles
7

La, Piana Federica. "Gestione e Indicizzazione di Dati in Contesti di Smart Transportation: un Approccio basato su Registri Distribuiti." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/24250/.

Full text
Abstract:
Veicoli a guida autonoma, nuovi modelli di Smart Mobility e servizi sempre più personalizzati stanno trasformando il mondo automobilistico che esige sempre più in sicurezza e affidabilità. I sistemi di trasporto intelligenti (ITS) consentono di affrontare in modo innovativo i problemi legati alla mobilità, attraverso soluzioni improntate su sicurezza, efficienza, efficacia e rispetto per l’ambiente. La loro realizzazione, però, comporta il superamento di alcuni aspetti che devono essere considerati e che sono legati alla raccolta, alla memorizzazione e al livello di affidabilità dei dati. Lo scopo del presente lavoro è quello di presentare un sistema di crowdsourcing decentralizzato, ideato per il contesto di Smart Transportation, che fa uso di un robusto schema di indicizzazione dei dati, pensato come alternativa ai tipici schemi centralizzati, sempre più frequentemente oggetto di attacchi e uso improprio. Interamente basato su tecnologie distribuite, oltre a fornire tracciabilità e immutabilità dei dati, il sistema in questione fa uso di una Distributed Hash Table come livello posto sopra la DLT, al fine di migliorare la gestione dei dati in un contesto in cui l'attenzione degli utenti è in progressivo incremento e dove, inoltre, efficacia e efficienza si rivelano più che importanti, necessari.
APA, Harvard, Vancouver, ISO, and other styles
8

Sibani, Riccardo. "Applied design of distributed ledgers for real estate and land registration." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-239005.

Full text
Abstract:
The recent emergence of a distributed technology named blockchain, clearly created a new point of view in the data storing and data distribution fields. If on one hand blockchain is mainly known for Bitcoin (an auto-regulated decentralized digital currency), on the other hand it has the potential to set up an auto regulated economy.In this thesis, the blockchain technology will be analyzed and described starting from P2P architecture and its origin in 2009 Satoshi Nakamoto’s whitepaper, and leading to the most up to date blockchains. The advantages and disadvantages of such architecture will be pointed out keeping in mind the security, speed and cost of such infrastructure.While Real Estate companies have often anticipated the technological innovations, land registries, instead, derive and keep a working manner which is extremely old and out of date: made of unclear procedures and wet signatures. The market needs and legislation will be researched mainly referring to other works and integrated with a technical point of view with particular focus on the decentralization of such systems.After analyzing the flow, problems and flaws of the current system, a new proposal will be researched, in particular trying to minimize the dead time in between the different steps of the mortgage, increase transparency, as well as reducing dependence on the central authorities, leading to more convenient interactions among the properties’ stakeholders. An attractive low capitalization decentralized financial product will also be proposed and implemented able to lower the interest rate and create a profitable investment with low risk, low interest and durable in time.Secure and ad-hoc algorithms will be presented and, in a later section, analyzed in combination with different blockchain technologies. Scalability and performance will also be evaluated, taking into account all the current technology limitations and the near future opportunities.
APA, Harvard, Vancouver, ISO, and other styles
9

Zhao, Nannan. "Towards a Flexible High-efficiency Storage System for Containerized Applications." Diss., Virginia Tech, 2020. http://hdl.handle.net/10919/100315.

Full text
Abstract:
Due to their tight isolation, low overhead, and efficient packaging of the execution environment, Docker containers have become a prominent solution for deploying modern applications. Consequently, a large amount of Docker images are created and this massive image dataset presents challenges to the registry and container storage infrastructure and so far has remained a largely unexplored area. Hence, there is a need of docker image characterization that can help optimize and improve the storage systems for containerized applications. Moreover, existing deduplication techniques significantly degrade the performance of registries, which will slow down the container startup time. Therefore, there is growing demand for high storage efficiency and high-performance registry storage systems. Last but not least, different storage systems can be integrated with containers as backend storage systems and provide persistent storage for containerized applications. So, it is important to analyze the performance of different backend storage systems and storage drivers and draw out the implications for container storage system design. These above observations and challenges motivate my dissertation. In this dissertation, we aim to improve the flexibility, performance, and efficiency of the storage systems for containerized applications. To this end, we focus on the following three important aspects: Docker images, Docker registry storage system, and Docker container storage drivers with their backend storage systems. Specifically, this dissertation adopts three steps: (1) analyzing the Docker image dataset; (2) deriving the design implications; (3) designing a new storage framework for Docker registries and propose different optimizations for container storage systems. In the first part of this dissertation (Chapter 3), we analyze over 167TB of uncompressed Docker Hub images, characterize them using multiple metrics and evaluate the potential of le level deduplication in Docker Hub. In the second part of this dissertation (Chapter 4), we conduct a comprehensive performance analysis of container storage systems based on the key insights from our image characterizations, and derive several design implications. In the third part of this dissertation (Chapter 5), we propose DupHunter, a new Docker registry architecture, which not only natively deduplicates layers for space savings but also reduces layer restore overhead. DupHunter supports several configurable deduplication modes, which provide different levels of storage efficiency, durability, and performance, to support a range of uses. In the fourth part of this dissertation (Chapter 6), we explore an innovative holistic approach, Chameleon, that employs data redundancy techniques such as replication and erasure-coding, coupled with endurance-aware write offloading, to mitigate wear level imbalance in distributed SSD-based storage systems. This high-performance fash cluster can be used for registries to speedup performance.
Doctor of Philosophy
The amount of Docker images stored in Docker registries is increasing rapidly and present challenges for the underlying storage infrastructures. Before we do any optimizations for the storage system, we should first analyze this big Docker image dataset. To this end, in this dissertation we perform the first large-scale characterization and redundancy analysis of the images and layers stored in the Docker Hub registry. Based on the findings, this dissertation presents a series of practical and efficient techniques, algorithms, optimizations to achieve high performance and flexibility, and space-efficient storage system for containerized applications. The experimental evaluation demonstrates the effectiveness of our optimizations and techniques to make storage systems flexible and space-efficacy.
APA, Harvard, Vancouver, ISO, and other styles
10

Ehsan, ul Haque Muhammad. "Persistence and Node FailureRecovery in Strongly Consistent Key-Value Datastore." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-121281.

Full text
Abstract:
Consistency preservation of replicated data is a critical aspect for distributed databaseswhich are strongly consistent. Further, in fail-recovery model each process also needs todeal with the management of stable storage and amnesia [1]. CATS is a key/value datastore which combines the Distributed Hash Table (DHT) like scalability and selforganization and also provides atomic consistency of the replicated items. However beingan in memory data store with consistency and partition tolerance (CP), it suffers frompermanent unavailability in the event of majority failure. The goals of this thesis were twofold (i) to implement disk persistent storage in CATS,which would allow the records and state of the nodes to be persisted on disk and (ii) todesign nodes failure recovery-algorithm for CATS which enable the system to run with theassumption of a Fail Recovery model without violating consistency. For disk persistent storage two existing key/value databases LevelDB [2] and BerkleyDB[3] are used. LevelDB is an implementation of log structured merged trees [4] where asBerkleyDB is an implementation of log structured B+ trees [5]. Both have been used as anunderlying local storage for nodes and throughput and latency of the system with each isdiscussed. A technique to improve the performance by allowing concurrent operations onthe nodes is also discussed. The nodes failure-recovery algorithm is designed with a goalto allow the nodes to crash and then recover without violating consistency and also toreinstate availability once the majority of nodes recover. The recovery algorithm is based onpersisting the state variables of Paxos [6] acceptor and proposer and consistent groupmemberships. For fault-tolerance and recovery, processes also need to copy records from the replicationgroup. This becomes problematic when the number of records and the amount of data ishuge. For this problem a technique for transferring key/value records in bulk is alsodescribed, and its effect on the latency and throughput of the system is discussed.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Distributed register"

1

Lanskov, P., M. Murashov, and D. Lanskov. Digital financial assets, their origin, development and prospects in the Russian financial market. ru: INFRA-M Academic Publishing LLC., 2022. http://dx.doi.org/10.12737/1859925.

Full text
Abstract:
The article discusses the economic, legal and technological foundations of the emergence of digital financial assets (CFAs) in the Russian financial market. The interrelation of the CFA and blockchain technology, which is a special case of the implementation of distributed ledger technology, is analyzed. From these positions, a vision of the role and place of cryptocurrencies in the future global economy is proposed. It is emphasized that the spread of cryptocurrencies has largely contributed to the popularization of the underlying blockchain technology, the declared advantages of this technology have been investigated. The practical aspects of the application of distributed registry technology in the context of Russian legislation are analyzed. As promising and alternative forms of CFA, the issue and placement of which is possible with the participation of securities market registrars, CFA certifying the possibility of exercising rights under equity securities, the right to demand the transfer of equity securities (tokens) and CFA directly certifying the rights to participate in the capital of a joint-stock company (digital shares) are considered. It is suggested that the global trend towards digitalization and the public need to improve the protection of investors' rights may lead to the transformation of undocumented shares into digital ones. The authors believe that digital shares in the form of CFA retain the advantages of non-documentary securities, but at the same time return the uniqueness of each individual share, as in the case of documentary securities, which much more reliably records their belonging to a specific owner.
APA, Harvard, Vancouver, ISO, and other styles
2

Bricas, Nicolas, Damien Conaré, and Marie Walser, eds. Une écologie de l'alimentation. éditions Quae, 2021. http://dx.doi.org/10.35690/978-2-7592-3353-3.

Full text
Abstract:
Repenser nos alimentations, c’est repenser nos sociétés. Car partager un repas et même faire ses courses sont des moyens de se relier aux autres. La façon de nous nourrir construit notre santé. Nos modes de production agricole façonnent nos paysages et définissent notre place dans la nature. Gérer des ressources pour produire, pour transformer et pour distribuer les aliments fonde nos économies. Nos registres du comestible, nos cuisines et nos manières de table racontent nos cultures. Enfin, et surtout, manger est un plaisir… C’est en reconnaissant toutes ces dimensions avec une égale importance que cet ouvrage aborde les enjeux contemporains de l’alimentation. La proposition d’une écologie de l’alimentation s’ancre dans le double registre d’une science des relations et d’un engagement politique. Une telle approche permet de revisiter, parfois de façon inattendue, les mots d’ordre de l’alimentation durable. Elle vise aussi à nourrir les démarches citoyennes, publiques et privées engagées dans la transformation des systèmes alimentaires. Entre essai d’experts et récit illustré d’exemples tirés des quatre coins du monde, cet ouvrage s’adresse aussi bien aux professionnels qu’à un grand public curieux des questions d’alimentation durable.
APA, Harvard, Vancouver, ISO, and other styles
3

Wenzel, Jennifer. The Disposition of Nature. Fordham University Press, 2019. http://dx.doi.org/10.5422/fordham/9780823286782.001.0001.

Full text
Abstract:
What role have literature and other cultural imagining played in shaping understandings of the world and the planet, for better and for worse? How might the formal innovations, rhetorical appeals, and sociological imbrication of world literature help confront unevenly distributed environmental challenges, including global warming? This book examines the rivalry between world literature and postcolonial theory from the perspective of environmental humanities, Anthropocene anxiety, and the material turn. Drawing its examples primarily from Africa and South Asia, it takes a contrapuntal approach to sites and subjects dispersed in time and space. Reading for the planet means reading from near to there: across experiential divides, between specific sites, at more than one scale. Recurrent concerns across the chapters are the multinational corporation (and the colonial charter company) as a vector of globalization and source of cultural imaginings and environmental harm; who (or what) can be regarded as a person; scenes of world-imagining from below in which characters or documentary subjects situate their experience within a transnational context; and formal strategies that invite reflexivity from the audience, in order to register, at the level of literary form, the uneven universality of vulnerability to environmental harm. The book argues for the relevance of the literary to environmental thought and practice. An understanding of cultural imagining and narrative logics can foster more robust accounts of global inequality, to energize movements for justice and livable futures.
APA, Harvard, Vancouver, ISO, and other styles
4

Andruchow, Marcela. El patrimonio plástico de la Facultad de Artes. Teseo, 2022. http://dx.doi.org/10.55778/ts878834498.

Full text
Abstract:
<p>En este libro se presentan los resultados de dos proyectos de investigación desarrollados por investigadores del Instituto de Historia del Arte Argentino y Americano de la Facultad de Artes, y conservadores-restauradores del Museo de Física de la Facultad de Ciencias Exactas (ambas unidades académicas de la UNLP). Los proyectos se orientaron a poner en valor la colección de arte de la facultad produciendo conocimientos historiográficos y propuestas de conservación para las obras.</p><p>Del total de la colección de aproximadamente 120 obras, que pertenece al Área Museo, Exposiciones y Conservación de la Facultad de Artes, en esta investigación se estudiaron las copias de yeso de esculturas provenientes de Europa y que forman conjuntos representativos del arte griego, románico, gótico y renacentista; además de las esculturas, pinturas, grabados, dibujos y mosaicos realizados y donados por docentes y graduados de la facultad.</p><p>Los resultados de la investigación que componen los contenidos del libro se distribuyen en distintos capítulos que presentan el alcance de los proyectos; el proceso de catalogación de la obra plana de la colección; el proceso de estudio y registro del estado de conservación de la obra plana; los resultados de la investigación de la colección de calcos de yeso; la indagación y diseño de las fichas de relevamiento confeccionadas <em>ad hoc</em> para utilizar en el estudio y registro del estado de conservación de las copias de yeso; el proceso de uso de esa ficha en el relevamiento y, finalmente, la propuesta y los resultados de la indagación en el diseño de estrategias físicas de protección y señalética de los calcos de yeso.</p>
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Distributed register"

1

Kirousis, Lefteris M., Evangelos Kranakis, and Paul M. B. Vitányi. "Atomic multireader register." In Distributed Algorithms, 278–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/bfb0019809.

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

Merritt, Michael, and Gadi Taubenfeld. "Atomic m-register operations." In Distributed Algorithms, 289–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/bfb0022454.

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

Chaudhuri, Soma, and Jennifer Welch. "Bounds on the costs of register implementations." In Distributed Algorithms, 402–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54099-7_27.

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

Anceaume, Emmanuelle, Romaric Ludinard, Maria Potop-Butucaru, and Frédéric Tronel. "Bitcoin a Distributed Shared Register." In Lecture Notes in Computer Science, 456–68. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-69084-1_34.

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

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
6

Raynal, Michel. "The Atomic Register Abstraction." In Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems, 3–13. Cham: Springer International Publishing, 2010. http://dx.doi.org/10.1007/978-3-031-02000-1_1.

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

Yang, Hua, Gang Cui, and Xiao-zong Yang. "2L-MuRR: A Compact Register Renaming Scheme for SMT Processors." In Parallel and Distributed Processing and Applications, 407–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11576235_43.

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

Abderazek, Ben A., Soichi Shigeta, Tsutomu Yoshinaga, and Masahiro Sowa. "On the Design of a Register Queue Based Processor Architecture (FaRM-rq)." In Parallel and Distributed Processing and Applications, 248–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-37619-4_26.

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

Koho, Mikko, Petri Leskinen, and Eero Hyvönen. "Integrating Historical Person Registers as Linked Open Data in the WarSampo Knowledge Graph." In Semantic Systems. In the Era of Knowledge Graphs, 118–26. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-59833-4_8.

Full text
Abstract:
Abstract Semantic data integration from heterogeneous, distributed data silos enables Digital Humanities research and application development employing a larger, mutually enriched and interlinked knowledge graph. However, data integration is challenging, involving aligning the data models and reconciling the concepts and named entities, such as persons and places. This paper presents a record linkage process to reconcile person references in different military historical person registers with structured metadata. The information about persons is aggregated into a single knowledge graph. The process was applied to reconcile three person registers of the popular semantic portal “WarSampo – Finnish World War 2 on the Semantic Web”. The registers contain detailed information about some 100 000 people and are individually maintained by domain experts. Thus, the integration process needs to be automatic and adaptable to changes in the registers. An evaluation of the record linkage results is promising and provides some insight into military person register reconciliation in general.
APA, Harvard, Vancouver, ISO, and other styles
10

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

Conference papers on the topic "Distributed register"

1

Li, Harry C., Allen Clement, Amitanand S. Aiyer, and Lorenzo Alvisi. "The Paxos Register." In 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007). IEEE, 2007. http://dx.doi.org/10.1109/srds.2007.32.

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

Li, Harry C., Allen Clement, Amitanand S. Aiyer, and Lorenzo Alvisi. "The Paxos Register." In 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007). IEEE, 2007. http://dx.doi.org/10.1109/srds.2007.4365689.

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

Hadzilacos, Vassos, Xing Hu, and Sam Toueg. "On Register Linearizability and Termination." In PODC '21: ACM Symposium on Principles of Distributed Computing. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3465084.3467925.

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

Kanjani, Khushboo, Hyunyoung Lee, and Jennifer L. Welch. "Byzantine fault-tolerant implementation of a multi-writer regular register." In Distributed Processing (IPDPS). IEEE, 2009. http://dx.doi.org/10.1109/ipdps.2009.5160903.

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

Alastruey, Jesus, Teresa Monreal, Victor Vinals, and Mateo Valero. "Microarchitectural Support for Speculative Register Renaming." In 2007 IEEE International Parallel and Distributed Processing Symposium. IEEE, 2007. http://dx.doi.org/10.1109/ipdps.2007.370237.

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

Whalley, David, and Gary Tyson. "Enhancing the effectiveness of utilizing an instruction register file." In Distributed Processing Symposium (IPDPS). IEEE, 2008. http://dx.doi.org/10.1109/ipdps.2008.4536413.

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

Goto, M., and T. Sato. "Leakage energy reduction in register renaming." In 24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings. IEEE, 2004. http://dx.doi.org/10.1109/icdcsw.2004.1284138.

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

Wang, Zhong, Xiaobo Sharon Hu, and Edwin H. M. Sha. "Register aware scheduling for distributed cache clustered architecture." In the 2003 conference. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/1119772.1119787.

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

Baldoni, Roberto, Silvia Bonomi, Anne-Marie Kermarrec, and Michel Raynal. "Implementing a Register in a Dynamic Distributed System." In 2009 29th IEEE International Conference on Distributed Computing Systems (ICDCS). IEEE, 2009. http://dx.doi.org/10.1109/icdcs.2009.46.

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

Chockler, Gregory, and Alexander Spiegelman. "Space Complexity of Fault-Tolerant Register Emulations." In PODC '17: ACM Symposium on Principles of Distributed Computing. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3087801.3087824.

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

Reports on the topic "Distributed register"

1

Acceptability of the female condom after a social marketing campaign in Campinas, Brazil. Population Council, 2001. http://dx.doi.org/10.31899/hiv2001.1000.

Full text
Abstract:
The female condom is a relatively new product that is intended to serve the dual role of protecting against unwanted pregnancy and sexually transmitted infections (STIs). Recent research has found moderate to high levels of initial trial and acceptance of the female condom among women. However, information is lacking about its continued use, particularly among women at high risk of HIV and other STIs. The female condom was registered in Brazil in January 1997 and since then has been available commercially through DKT, a social marketing organization. In addition to socially marketed female condoms, the Brazilian Ministry of Health has also given female condoms to public health clinics and community organizations to distribute free as part of activities targeted to vulnerable groups of women. This brief summarizes the findings from a study that examined the role of the female condom as a method of protection against HIV/STIs among female sex workers in Campinas, Brazil, who received increased access to the product and information about it through an educational and social marketing intervention.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Distributed register' for particular source types:
Journal articles Dissertations / Theses
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