Sökning: "partition tolerance"

Hittade 5 uppsatser innehållade orden partition tolerance.

  1. 1. Highly Available Task Scheduling in Distinctly Branched Directed Acyclic Graphs

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Patrik Zhong; [2023]
    Nyckelord :Distributed Scheduling; Fault-tolerance; Graph Partitioning; Task Graphs; Dask; Dask Distributed; Data Processing; Distribuerad Schemaläggning; Feltolerans; Grafpartitionering; Uppgiftsgrafer; Dask; Dask Distributed; Dataprocessering;

    Sammanfattning : Big data processing frameworks utilizing distributed frameworks to parallelize the computing of datasets have become a staple part of the data engineering and data science pipelines. One of the more known frameworks is Dask, a widely utilized distributed framework used for parallelizing data processing jobs. LÄS MER

  2. 2. Distributed Robust Learning

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Akhil Yerrapragada; [2021]
    Nyckelord :Byzantine resilient decentralized training; Gradient aggregation rules; α; f Byzantine resilience; Fault tolerance; Ring all-reduce.; Byzantinsk motståndskraftig decentraliserad träning; Gradientaggregeringsregler; α; f Byzantinsk motståndskraft; Feltolerans; Ring allreducera.;

    Sammanfattning : Accuracy obtained when training deep learning models with large amounts of data is high, however, training a model with such huge amounts of data on a single node is not feasible due to various reasons. For example, it might not be possible to fit the entire data set in the memory of a single node, training times can significantly increase since the dataset is huge. LÄS MER

  3. 3. Practitioners’ view on command query responsibility segregation

    Magister-uppsats, Lunds universitet/Institutionen för informatik

    Författare :Martin Nilsson; Nazife Korkmaz; [2014]
    Nyckelord :Business and Economics;

    Sammanfattning : Relational database management systems (RDBMS) have long been a predominant technology in information systems (IS). Today, however, the ever-changing technology landscape seems to be the proving grounds for many alternative approaches. For instance, alternative databases are currently used in many cloud services that affect everyday life. LÄS MER

  4. 4. Persistence and Node FailureRecovery in Strongly Consistent Key-Value Datastore

    Master-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Författare :Muhammad Ehsan ul Haque; [2012]
    Nyckelord :Datastore; Distributed Hash Table DHT ; Atomic Shared Registers; Disk Storage; Consistency; Failure Recovery; Paxos; Group Membership;

    Sammanfattning : 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]. LÄS MER

  5. 5. Implementation of a Manycast Protocol in a Partitionable Mobile Ad hoc Network

    Uppsats för yrkesexamina på avancerad nivå, Institutionen för datavetenskap

    Författare :Gustav Nykvist; [2009]
    Nyckelord :mobile ad hoc network; multi-hop; partition tolerance; random-walk gossip-based manycast;

    Sammanfattning : Wireless communication has grown very popular, and communication is the key to success in many situations. However, most of the common technologies today rely on infrastructure and in disaster situations infrastructure might be lost or get severely overloaded. This master thesis concerns intermittently connected mobile ad hoc networks. LÄS MER