The following topics are dealt with: parallel processing of database operations;parallel machines;parallel joins;parallel algorithms;distributedsystems;and distributed query processing.
ISBN:
(纸本)0818620528
The following topics are dealt with: parallel processing of database operations;parallel machines;parallel joins;parallel algorithms;distributedsystems;and distributed query processing.
Conference proceedings front matter may contain various advertisements, welcome messages, committee or program information, and other miscellaneous conference information. This may in some cases also include the cover...
Conference proceedings front matter may contain various advertisements, welcome messages, committee or program information, and other miscellaneous conference information. This may in some cases also include the cover art, table of contents, copyright statements, title-page or half title-pages, blank pages, venue maps or other general information relating to the conference that was part of the original conference proceedings.
Given the inherent reliance of distributedsystems on concurrent programming, coupled with increased hardware concurrency and diversity, ensuring their reliability, safety, and security without compromising performanc...
详细信息
ISBN:
(纸本)9783031753794;9783031753800
Given the inherent reliance of distributedsystems on concurrent programming, coupled with increased hardware concurrency and diversity, ensuring their reliability, safety, and security without compromising performance has become exceedingly challenging. This necessitates scalable verification methods that can accurately capture the behavior of concurrent and distributedsystems while providing robust guarantees of compliance with specific requirements. The Scalable Verification and Validation of Concurrent and distributedsystems (ScaVeri) track is dedicated to presenting and discussing advancements in formal methods tailored to these systems. Emphasizing scalable techniques and models that have been validated through real-world case studies, the track covers subtopics such as generating correct parallel code, compositional verification with assume-guarantee contracts, enhanced analysis for large-scale systems, and combinations of various analysis techniques, collectively aiming to improve the assurance of diverse and complex distributed computing environments.
This article presents a short (and partial) history of synchronization in systems made up of asynchronous sequential processes (automata). Among other points, it shows that synchronization (which consists in ordering ...
详细信息
ISBN:
(纸本)9783031744976;9783031744983
This article presents a short (and partial) history of synchronization in systems made up of asynchronous sequential processes (automata). Among other points, it shows that synchronization (which consists in ordering operations issued by processes on shared objects) has a different flavor according to the fact that the objects are physical objects (such as a printer or a disk) or logical objects (immaterial objects represented by sequences of bits). It then follows from this physical/logical nature of computing objects that mutual exclusion is to physical objects what consensus is to logical objects. The article also addresses recent results on process synchronization in fully anonymous systems (systems in which processes cannot be distinguished one from the other, and where there is a disagreement on the addresses of the memory registers.
The rapid proliferation of images, driven by advancements in image-capturing technologies, poses significant challenges to the efficient management and retrieval of images from vast databases. Traditional Content-Base...
详细信息
The rapid proliferation of images, driven by advancements in image-capturing technologies, poses significant challenges to the efficient management and retrieval of images from vast databases. Traditional Content-Based Image Retrieval (CBIR) systems struggle with scalability and complexity, resulting in suboptimal retrieval performance. To address these challenges, this paper explores the integration of CBIR with Hadoop, a well-established distributed computing framework. Hadoop's capability to handle large-scale data processing, utilizing its MapReduce model and Hadoop distributed File System (HDFS), offers a promising solution to enhance the effectiveness and scalability of image retrieval tasks. Our solution combines the strengths of CBIR and Hadoop, using our proposed Full Directional Local Neighbor Pattern (FDLNP) method for feature extraction. This method captures local patterns, color, texture, and directional information to provide a comprehensive image representation, significantly improving retrieval accuracy. We present a detailed design and implementation of this integrated system, emphasizing its two main phases: the offline phase, which constructs the feature database using FDLNP and MapReduce jobs, and the online phase, which extracts features from query images and calculates similarity distances using parallel processing. Experimental results on a Hadoop cluster reveal a significant improvement in processing efficiency, particularly for large datasets, highlighting the advantages of distributed processing in managing extensive image retrieval tasks. The findings indicate that while single-node systems may be suitable for smaller datasets, Hadoop clusters are preferable for larger-scale image databases due to their scalability and concurrent processing capabilities. Integrating CBIR with Hadoop, enhanced by our FDLNP method, provides a powerful tool for organizing and searching images in vast databases, offering improved retrieval performance, scalabi
The global state of a distributed system is most commonly stored in databases. databases are responsible for ensuring that the data is available, durable, and correct at some level of consistency. However, this approa...
详细信息
Online GNN inference has been widely explored by applications such as online recommendation and financial fraud detection systems, where even minor delays can result in significant financial impact. Real-time dynamic ...
详细信息
ISBN:
(纸本)9798400714436
Online GNN inference has been widely explored by applications such as online recommendation and financial fraud detection systems, where even minor delays can result in significant financial impact. Real-time dynamic graph sampling enables online GNN inference to reflect the latest graph updates in real-world graphs. However, online GNN inference typically demands millisecond-level latency Service Level Objectives (SLOs) as its performance guarantees, which poses great challenges for existing dynamic graph sampling approaches based on graph databases. The issues mainly arise from two aspects: long tail latency due to imbalanced data-dependent sampling and large communication overhead incurred by distributed sampling. To address these issues, we propose Helios, an efficient distributed dynamic graph sampling service to meet the stringent latency SLOs. The key ideas of Helios are 1) pre-sampling the dynamic graph in an event-driven approach, and 2) maintaining a query-aware sample cache to build the complete K-hop sampling results locally for inference requests. Experiments on multiple datasets show that Helios achieves up to 67x higher serving throughput and up to 32x lower P99 query latency compared to baselines.
Exploration of different network topologies is one of the fundamental problems of distributedsystems. The problem has been studied on networks like lines, rings, tori, rectangular grids, etc. In this work, we have co...
详细信息
ISBN:
(纸本)9783031744976;9783031744983
Exploration of different network topologies is one of the fundamental problems of distributedsystems. The problem has been studied on networks like lines, rings, tori, rectangular grids, etc. In this work, we have considered a rectangle enclosed triangular grid (RETG). A RETG is a part of an infinite triangular grid and the part is enclosed by a rectangle whose one pair of parallel sides aligns with a family of parallel straight lines of the infinite triangular grid. We have studied the problem of perpetual exploration on a RETG using oblivious robots. We have considered the robots with limited visibility i.e. the robots are myopic. Infinite visibility becomes impractical for a very large network. Limited visibility is more practical than infinite visibility. The robots have neither any chirality nor any axis agreement. An algorithm is provided to explore the RETG perpetually without any collision. The algorithm works under a synchronous scheduler. The algorithm requires three robots with two hop visibility.
With the attractive characteristics of scalability, strong consistency, and high availability, distributeddatabases have attracted much attention. Moreover, application-oriented database development promotes the fast...
详细信息
暂无评论