Time/Utility Function Decomposition in Soft Real-Time Distributed Systems

2004 ◽  
Author(s):  
E. D. Jensen
Keyword(s):  
Distributed Systems ◽  
Utility Function ◽  
Real Time ◽  
Function Decomposition

XERIS/APEX

2021 ◽  
Vol 40 (2) ◽  
pp. 65-69
Author(s):  
Richard Wai
Keyword(s):  
Distributed Systems ◽  
Real Time ◽  
Distributed System ◽  
Dynamic Scaling ◽  
Distributed Application ◽  
Heavy Weight ◽  
System Models ◽  
In The Wild ◽  
On Line ◽  
Language Technologies

Modern day cloud native applications have become broadly representative of distributed systems in the wild. However, unlike traditional distributed system models with conceptually static designs, cloud-native systems emphasize dynamic scaling and on-line iteration (CI/CD). Cloud-native systems tend to be architected around a networked collection of distinct programs ("microservices") that can be added, removed, and updated in real-time. Typically, distinct containerized programs constitute individual microservices that then communicate among the larger distributed application through heavy-weight protocols. Common communication stacks exchange JSON or XML objects over HTTP, via TCP/TLS, and incur significant overhead, particularly when using small size message sizes. Additionally, interpreted/JIT/VM-based languages such as Javascript (NodeJS/Deno), Java, and Python are dominant in modern microservice programs. These language technologies, along with the high-overhead messaging, can impose superlinear cost increases (hardware demands) on scale-out, particularly towards hyperscale and/or with latency-sensitive workloads.

Language constructs for real-time distributed systems

1982 ◽  
Vol 7 (1) ◽  
pp. 11-20 ◽  
Author(s):  
D.M. Berry ◽  
C. Ghezzi ◽  
D. Mandrioli ◽  
F. Tisato
Keyword(s):  
Distributed Systems ◽  
Real Time ◽  
Language Constructs

scholarly journals Multi-Robot Searching using Game-Theory Based Approach

10.5772/6232 ◽  
2008 ◽  
Vol 5 (4) ◽  
pp. 44 ◽  
Author(s):  
Yan Meng
Keyword(s):  
Game Theory ◽  
Dynamic Programming ◽  
Utility Function ◽  
Real Time ◽  
Dynamic Environment ◽  
Equilibrium Solutions ◽  
Strategy Equilibrium ◽  
The Game Theory ◽  
Target Searching ◽  
Multi Robot

This paper proposes a game-theory based approach in a multi–target searching using a multi-robot system in a dynamic environment. It is assumed that a rough priori probability map of the targets' distribution within the environment is given. To consider the interaction between the robots, a dynamic-programming equation is proposed to estimate the utility function for each robot. Based on this utility function, a cooperative nonzero-sum game is generated, where both pure Nash Equilibrium and mixed-strategy Equilibrium solutions are presented to achieve an optimal overall robot behaviors. A special consideration has been taken to improve the real-time performance of the game-theory based approach. Several mechanisms, such as event-driven discretization, one-step dynamic programming, and decision buffer, have been proposed to reduce the computational complexity. The main advantage of the algorithm lies in its real-time capabilities whilst being efficient and robust to dynamic environments.

Sign in / Sign up

Export Citation Format

Share Document