Distributed Processing System by History for Load Balancing

1998 ◽  
Vol 31 (28) ◽  
pp. 33-37
Author(s):  
Keizou Yasumatsu ◽  
Yuji Takeda ◽  
Hideki Murakoshi ◽  
Noboru Funakubo
Keyword(s):  
Load Balancing ◽  
Distributed Processing ◽  
Processing System

scholarly journals A Clustered Approach for Load Balancing in Distributed Systems

2021 ◽  
Vol 23 (06) ◽  
pp. 448-463
Author(s):  
Mrs. Geetmala ◽  
◽  
Dr. Neelendra Badal ◽  
Dr. Shri Om Mishra ◽  
◽  
...  
Keyword(s):  
Distributed Systems ◽  
Load Balancing ◽  
Distributed Processing ◽  
Processing System ◽  
Holistic View ◽  
Workload Balancing ◽  
Single System Image ◽  
Computational Paradigm ◽  
Load Balancing Algorithm ◽  
And Storage

Distributed systems are increasingly becoming the dominant and rapidly expanding computational paradigm of tomorrow. A cluster is really a form of parallel or distributed processing system that consists of a set of intertwined stand-alone machines that function together like truly coherent computing and storage resources with a single system image (SSI) which means that perhaps the clusters are viewed as a single platform by the consumers. Global resource management, on the other hand, poses several concerns due to the sheer complexity and range of tools, as well as the need for user accountability. The possible advantages of load balancing in addressing the occasional congestion faced by some nodes when everyone else is idle or congested are widely agreed on a level of performance. This is also widely acknowledged that neither specific load balancing algorithm can adequately address evolving device characteristics and complex capacity management in a distributed ecosystem. To have a systematic approach and also in distributed systems, a proposed approach is created for a holistic view of element load balancing and also the qualities features of load balancing algorithms. The nomenclature has been expanded. In order for adaptive algorithms to understand the problem and manner of prefixing resilience along with different components in distributed systems, they must first recognize the concerns. In addition, a proposed approach is specified. The much more effective load balancing techniques and the modeling hypotheses used in prior load balancing experiments are established through a study of related research. We consider the most appropriate load balancing algorithm and optimum metrics for parameter estimation of the algorithm as a consequence of and output of this assessment for a range of formulations of resulting goals, distributed system features, and workload balancing framework.

II. Your Present Moment in Spacetime

2021 ◽  
Vol 2021 (06) ◽  
pp. 0626
Author(s):  
Conrad Dale Johnson
Keyword(s):  
Quantum Physics ◽  
Distributed Processing ◽  
Processing System ◽  
Physical World ◽  
Measuring Instruments ◽  
Present Moment ◽  
Local Measurement ◽  
Hyperbolic Structure ◽  
Objective Reality ◽  
Block Universe

This essay extends the argument begun in "Why Quantum Mechanics Makes Sense," exploring the conditions under which a physical world can define and communicate information. I argue that like the structure of quantum physics, the principles of Special and General Relativity can be understood as reflecting the requirements of a universe in which things are observable and measurable. I interpret the peculiar hyperbolic structure of spacetime not as the static, four-dimensional geometry of an unobservable "block universe", but as the background metric of an evolving web of communicated information that we, along with all our measuring instruments and recording devices, actually experience in our local "here and now." Our relativistic universe is conceived as a parallel distributed processing system, in which a common objective reality is constantly being woven out of many kinds of facts determined separately in countless local measurement-contexts.

Dynamic Scheduling Model of Rail-Guided Vehicle (RGV) Based on Genetic Algorithms in the Context of Mobile Computing

2021 ◽  
Vol 12 (1) ◽  
pp. 43-62
Author(s):  
Chen Xu ◽  
Xueyan Xiong ◽  
Qianyi Du ◽  
Shudong Liu ◽  
Yipeng Li ◽  
...  
Keyword(s):  
Information System ◽  
Mobile Computing ◽  
Dynamic Scheduling ◽  
Distributed Processing ◽  
Processing System ◽  
Time Dynamic ◽  
Scheduling Model ◽  
Practical Operation ◽  
Optimization Efficiency ◽  
Production And Operation

Track guidance vehicle (RGV) is widely used in logistics warehousing and intelligent workshop, and its scheduling effectiveness will directly affect the production and operation efficiency of enterprises. In practical operation, central information system often lacks flexibility and timeliness. By contrast, mobile computing can balance the central information system and the distributed processing system, so that useful, accurate, and timely information can be provided to RGV. In order to optimize the RGV scheduling problem in uncertain environment, a genetic algorithm scheduling rule (GAM) using greedy algorithm as the genetic screening criterion is proposed in this paper. In the experiment, RGV scheduling of two-step processing in an intelligent workshop is selected as the research object. The experimental results show that the GAM model can carry out real-time dynamic programming, and the optimization efficiency is remarkable before a certain threshold.

scholarly journals Dynamic Partitioning Supporting Load Balancing for Distributed RDF Graph Stores

Symmetry ◽  
2019 ◽  
Vol 11 (7) ◽  
pp. 926
Author(s):  
Kyoungsoo Bok ◽  
Junwon Kim ◽  
Jaesoo Yoo
Keyword(s):  
Load Balancing ◽  
Distributed Processing ◽  
Data Partitioning ◽  
Rdf Graph ◽  
Dynamic Partitioning ◽  
Usage Frequency ◽  
Partitioning Methods ◽  
Description Framework ◽  
Rdf Graphs ◽  
Distributed Server

Various resource description framework (RDF) partitioning methods have been studied for the efficient distributed processing of a large RDF graph. The RDF graph has symmetrical characteristics because subject and object can be used interchangeably if predicate is changed. This paper proposes a dynamic partitioning method of RDF graphs to support load balancing in distributed environments where data insertion and change continue to occur. The proposed method generates clusters and subclusters by considering the usage frequency of the RDF graph that are used by queries as the criteria to perform graph partitioning. It creates a cluster by grouping RDF subgraphs with higher usage frequency while creating a subcluster with lower usage frequency. These clusters and subclusters conduct load balancing by using the mean frequency of queries for the distributed server and conduct graph data partitioning by considering the size of the data stored in each distributed server. It also minimizes the number of edge-cuts connected to clusters and subclusters to minimize communication costs between servers. This solves the problem of data concentration to specific servers due to ongoing data changes and additions and allows efficient load balancing among servers. The performance results show that the proposed method significantly outperforms the existing partitioning methods in terms of query performance time in a distributed server.

Sign in / Sign up

Export Citation Format

Share Document