Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 19 of 19 for “"Multiple servers"”.

  1. A modelling and networking architecture for distributed virtual environments with multiple servers.

    … a single-person running on a single computer, to multiple-people running on several computers connected through a network. When VEs are distributed on multiple computers across a network, we call this a Distributed Virtual Environment (DVE). Virtual Environments can benefit greatly from …

    hull Repository record for A modelling and networking architecture for distributed virtual environments with multiple servers. (opens in a new tab)

  2. A Distributed Software Framework for the Virginia Tech Ground Station

    … tasks and process at a ground station with multiple servers and controllers, a specialized actor framework was written in Python for ease of use. Actors have the ability to send messages to one another over a network, and they maintain their own memory in order to avoid synchronization …

    vt Repository record for A Distributed Software Framework for the Virginia Tech Ground Station (opens in a new tab)

  3. Staffing queueing systems with cyclical demand and unreliable servers

    Unplanned staff absences, referring to scheduled servers being unavailable, pose significant challenges in sectors like healthcare, airlines, and correctional facilities, leading to under-staffing and management reliability issues. This thesis investigates the effectiveness of the Stationary …

    uoit Repository record for Staffing queueing systems with cyclical demand and unreliable servers (opens in a new tab)

  4. A distributed metadata-private messaging system

    … being able to scale its work efficiently across multiple servers. Stadium uses the same differential privacy definition for metadata privacy as Vuvuzela, the currently highest-scale system. However, providing privacy in Stadium is significantly more challenging because distributing users' traffic …

    mit Repository record for A distributed metadata-private messaging system (opens in a new tab)

  5. Fairness for resource allocation in cloud computing.

    Resource allocation with fairness, considering multiple types of resources has become a substantial concern in state-of-the-art computing systems. Accordingly, the rapid growth of cloud computing has highlighted the importance of resource management as a complicated and NP-hard problem. Unlike …

    bournemouth Repository record for Fairness for resource allocation in cloud computing. (opens in a new tab)

  6. Efficient hardware/software architectures for highly concurrent network servers

    … performance improvements slows, however, network servers can no longer rely on uniprocessor technology to fuel the overall performance improvements necessary for next-generation, high-bandwidth applications. Furthermore, rising per-machine power costs in the datacenter are driving demand for …

    rice Repository record for Efficient hardware/software architectures for highly concurrent network servers (opens in a new tab)

  7. Analysis of congested clients' flows in banking systems: A case study of Standard Bank Namibia

    … was M/M/s which involved a single line with multiple servers in the system.Customer arrivals were described by a poison distribution and service times by exponential distribution. Descriptive analysis was used to describe the parameters of the queuing system, a radar chart to display the …

    namibia Repository record for Analysis of congested clients' flows in banking systems: A case study of Standard Bank Namibia (opens in a new tab)

  8. Efficient cryptographic primitives: Secure comparison, binary decomposition and proxy re-encryption

    … can be done on the encrypted data by utilizing multiple servers. We analyze the security and the complexity of our proposed protocols, and their efficiencies are evaluated by comparing with the existing solutions.”--Abstract, page iii.</p>

    must-thes Repository record for Efficient cryptographic primitives: Secure comparison, binary decomposition and proxy re-encryption (opens in a new tab)

  9. Rich Cloud-based Web Applications with Cloudbrowser 2.0

    … CloudBrowser 2.0 can be deployed on a cluster of servers as well as a single multi-core server. It distributes the virtual browsers to multiple processes and dispatches client requests to the associated virtual browsers. CloudBrowser 2.0 also refines the CloudBrowser application deployment model …

    vt Repository record for Rich Cloud-based Web Applications with Cloudbrowser 2.0 (opens in a new tab)

  10. Distributed Approach for Peptide Identification

    … has two steps: Execute the C-Ranker algorithm on servers specified by the user and compare the correct PSM’s data generated via the distributed approach with the normal execution approach of C-Ranker.</p> <p>The objective of this framework is to process expansive peptide datasets utilizing a …

    wku-diss Repository record for Distributed Approach for Peptide Identification (opens in a new tab)

  11. Fault-tolerant distributed transactions for partitioned OLTP databases

    … partitioning data across a cluster of commodity servers in a data center. Combining multiple servers together allows systems built with Dtxn to be cost effective, highly available, scalable, and fault-tolerant. Dtxn provides three novel features. First, it provides reusable infrastructure for …

    mit Repository record for Fault-tolerant distributed transactions for partitioned OLTP databases (opens in a new tab)

  12. Multi-server federated learning in vehicular edge computing

    … act as clients and roadside units (RSUs) host FL servers at the edge. However, practical deployments face multiple challenges: highly non-IID and noisy data across vehicles, heterogeneous computation and communication resources, private training costs, intermittent connectivity, and the need to …

    uoit Repository record for Multi-server federated learning in vehicular edge computing (opens in a new tab)

  13. Measuring the impact of site configurations on site fingerprinting over the web and Tor

    … and hosting sites from both single and multiple servers in order to observe the effect of each of these changes on fingerprinting accuracy. In order to collect traces from sites that reflect our experimental changes, we create models of real-world sites and onion services that capture …

    uiuc Repository record for Measuring the impact of site configurations on site fingerprinting over the web and Tor (opens in a new tab)

  14. A next-generation apparatus for lithium optical lattice experiments

    … for sequence design and a set of output hardware servers. Output hardware servers are designed to use standard National Instruments output cards, but the client-server nature allows this to be extended to other output hardware. Output sequences running on multiple servers and output cards can be …

    mit Repository record for A next-generation apparatus for lithium optical lattice experiments (opens in a new tab)

  15. New directions for remote data integrity checking of cloud storage

    … in which the data is stored redundantly at multiple servers. The client can use RDC to check each server and, upon having detected a corrupted server, it can repair this server by retrieving data from healthy servers, so that the reliability level can be maintained. Previously, RDC has been …

    njit Repository record for New directions for remote data integrity checking of cloud storage (opens in a new tab)

  16. Online scheduling algorithms for average flow time and its variants

    … that are found in a client-server setting where multiple clients and one server (or multiple servers) are the participating entities. Clients send their requests to the server(s) over time, and the server needs to satisfy the requests using its resources. This setting is prevalent in many …

    uiuc Repository record for Online scheduling algorithms for average flow time and its variants (opens in a new tab)

  17. Metrics, fundamental trade-offs and control policies for delay-sensitive applications in volatile environments

    … Second, we generalize the results to the case of multiple servers or peers streaming to a single receiver. Random linear network coding allows us to simplify the packet selection strategies and alleviate issues such as duplicate packet reception. We show that the multi-server streaming problem …

    mit Repository record for Metrics, fundamental trade-offs and control policies for delay-sensitive applications in volatile environments (opens in a new tab)

  18. Generalised analytic queueing network models. The need, creation, development and validation of mathematical and computational tools for the construction of analytic queueing network models capturing more critical system behaviour.

    … Bernoulli feedback and load dependent rate, multiple GE servers. In the tandem finite buffer algorithm the building block illustrates problems encountered modelling high variability in blocking networks. ': . _. A parametric validation study is made of approximations for single class closed …

    bradford Repository record for Generalised analytic queueing network models. The need, creation, development and validation of mathematical and computational tools for the construction of analytic queueing network models capturing more critical system behaviour. (opens in a new tab)