scholarly journals Using Overlay Networks to Build Operating System Services for Large Scale Grids

2006 ◽  
Author(s):  
Emmanuel Jeanvoine ◽  
Louis Rilling ◽  
Christine Morin ◽  
Daniel Leprince
Keyword(s):  
Operating System ◽  
Large Scale ◽  
Overlay Networks

A Fully Distributed Method to Detect and Reduce Cut Vertices in Large-Scale Overlay Networks

2012 ◽  
Vol 61 (7) ◽  
pp. 969-985 ◽  
Author(s):  
Xiaomei Liu ◽  
Li Xiao ◽  
Andrew Kreling
Keyword(s):  
Large Scale ◽  
Overlay Networks ◽  
Distributed Method

scholarly journals A Cloud-Based In-Field Fleet Coordination System for Multiple Operations

Energies ◽  
2020 ◽  
Vol 13 (4) ◽  
pp. 775 ◽  
Author(s):  
Caicong Wu ◽  
Zhibo Chen ◽  
Dongxu Wang ◽  
Bingbing Song ◽  
Yajie Liang ◽  
...  
Keyword(s):  
Operating System ◽  
Large Scale ◽  
Field Experiments ◽  
Flow Shop ◽  
Time Windows ◽  
Fleet Management ◽  
Prototype System ◽  
Arable Farming ◽  
Coordination System ◽  
Multiple Machines

In large-scale arable farming, multiple sequential operations involving multiple machines must be carried out simultaneously due to restrictions of short time windows. However, the coordination and planning of multiple sequential operations is a nontrivial task for farmers, since each operation may have its own set of operational features, e.g., operating width and turning radius. Taking the two sequential operations—hoeing cultivation and seeding—as an example, the seeder has double the width of the hoeing cultivator, and the seeder must remain idle while waiting for the hoeing cultivator to finish two rows before it can commence its seeding operation. A flow-shop working mode can coordinate multiple machines in multiple operations within a field when different operations have different implement widths. To this end, an auto-steering-based collaborative operating system for fleet management (FMCOS) was developed to realize an in-field flow-shop working mode, which is often adopted by the scaled agricultural machinery cooperatives. This paper proposes the structure and composition of the FMCOS, the method of operating strip segmenting, and a new algorithm for strip state updating between successive field operations under an optimal strategy for waiting time conditioning between sequential operations. A simulation model was developed to verify the state-updating algorithm. Then, the prototype system of FMCOS was combined with auto-steering systems on tractors, and the collaborative operating system for the server was integrated. Three field experiments of one operation, two operations, and three operations were carried out to verify the functionality and performance of FMCOS. The results of the experiment showed that the FMCOS could coordinate in-field fleet operations while improving both the job quality and the efficiency of fleet management by adopting the flow-shop working mode.

scholarly journals Research and Evaluation of RoCE in IHEP Data Center

2021 ◽  
Vol 251 ◽  
pp. 02018
Author(s):  
Shan Zeng ◽  
Fazhi Qi ◽  
Lei Han ◽  
Xiangyu Gong ◽  
Tao Wu
Keyword(s):  
Operating System ◽  
Data Center ◽  
Large Scale ◽  
Main Memory ◽  
Technology Selection ◽  
Low Latency ◽  
Future Plan ◽  
Future Technology ◽  
High Bandwidth ◽  
Exchange Data

With more and more large-scale scientific facilities are built, more and more HPC requirements are needed in IHEP. RDMA is a technology that allows servers in a network to exchange data in main memory without involving the processor, cache or operating system of either server, which can provide high bandwidth and low latency. There are two RDMA technologies which were InfiniBand and a relative newcomer called RoCE – RDMA over Converged Ethernet. This paper introduces the RoCE technology, we research and compare the performance of both IB and RoCE in IHEP data center, and we also evaluate the application scenarios of RoCE which can support our future technology selection in HEPS. In the end, we present our future plan.

Topology Design for Large Scale Service Overlay Networks

2010 ◽  
Vol 32 (4) ◽  
pp. 841-845
Author(s):  
Dong Zhang ◽  
Chun-ming Wu ◽  
Ming Jiang ◽  
Wei Xiong
Keyword(s):  
Large Scale ◽  
Overlay Networks ◽  
Topology Design ◽  
Service Overlay Networks

Three Dimensional Hypercube Model and Mechanism

2015 ◽  
Vol 5 (2) ◽  
pp. 62-79
Author(s):  
Prashant Kumar Patra ◽  
Padma Lochan Pradhan
Keyword(s):  
Operating System ◽  
Access Control ◽  
Large Scale ◽  
Three Dimensional ◽  
Automated System ◽  
System Control ◽  
Sensitive Information ◽  
Control Mechanisms ◽  
Risk Optimization ◽  
System Resources

The automated access control mechanism afforded to an automated system control in order to attain the maximum objectives of preserving the confidentiality, integrity, authentication & high availability of information system resources. The risk optimization is the process of identifying vulnerabilities, risk, uncertainties and threats to operating system resources to achieving the maximum business objectives and deciding the maximum counter measures in to optimizing the lowest level of risk. This proposed three dimensional hypercube security models and mechanism is going to be providing high level accountability for individuals who are accessing sensitive information on multiple relation functions, operation and services (RFOS) on multiple application, system software, server and network. This accountability is accomplished through access control mechanisms & services that require Confidentiality, Integrity, Authentication, Access control, Non repudiation, Availability & Privacy through operating system control and audit function. One has to develop the computer algebraic system over a relation, function, operation & services for multiple business, resources and location for risk optimization on complex real time large scale operating system. This paper contributes to the development of an optimization mechanism that objective to determine the optimal cost to be invested into security mechanisms on the measure component of the system security. Furthermore, the model optimize the cost, time & resources is supposed to optimize the system risks and maximize the business throughput and high security system. One has to develop one solution (ACM) for multiple issue which is satisfying to the pervasive and ubiquitous computing based on distributed object oriented system.

Adaptive Self-Organization in Distributed Tree Topologies

2014 ◽  
Vol 5 (3) ◽  
pp. 24-57 ◽  
Author(s):  
Evangelos Pournaras ◽  
Martijn Warnier ◽  
Frances M.T. Brazier
Keyword(s):  
Large Scale ◽  
Overlay Networks ◽  
Adaptation Strategies ◽  
Self Organization ◽  
Self Organized ◽  
Trade Offs ◽  
Organization Process ◽  
Tree Topologies ◽  
Hierarchical Communication ◽  
Message Overhead

Tree topologies are often deployed in large-scale distributed systems to structure a hierarchical communication. Building and maintaining overlay networks self-organized in tree topologies is challenging to achieve in dynamic environments. Performance trade-offs between resilience to failures and message overhead need to be considered. This paper introduces eight adaptation strategies that provide a higher abstraction, modularity and reconfigurability in the tree self-organization process. Performance can be further enhanced by dynamically changing strategies during system runtime. Experimental evaluation illustrates the performance trade-offs and properties of adaptation strategies.

scholarly journals Self-Stabilizing Prefix Tree Based Overlay Networks

2016 ◽  
Vol 27 (05) ◽  
pp. 607-630
Author(s):  
Eddy Caron ◽  
Ajoy K. Datta ◽  
Franck Petit ◽  
Cédric Tedeschi
Keyword(s):  
Dynamic Systems ◽  
Message Passing ◽  
Large Scale ◽  
Overlay Networks ◽  
Initial State ◽  
Prefix Tree ◽  
Distributed Structure ◽  
Distributed Structures ◽  
Self Stabilization ◽  
The Many

Computing over large platforms calls for the ability to maintain distributed structures at large scale. Among the many different structures proposed in this context, the prefix tree structure has been identified as an adequate one for indexing and retrieving information. One weakness of using such a distributed structure stands in its poor native fault tolerance, leading to the use of preventive costly mechanisms such as replication.Self-stabilization is a suitable approach to design reliable solutions for dynamic systems, and was recently enhanced with new models to be able to deal with large scale dynamic platforms. A self-stabilizing system is guaranteed to reach a correct configuration, whatever its initial state is. Following this path, it is becoming possible to make distributed structures self-stabilizing at large scale.In this paper, we focus on making tries self-stabilizing over such platforms, and propose a self-stabilizing maintenance algorithm for a prefix tree using a message passing model. The proof of self-stabilization is provided, and simulation results are given, to better capture its performances. Still based on simulations, we provide evidences that the protocol, beyond its capacity to repair the structure, can significantly improve the system’s availability, even when the system is not yet stabilized.

Sign in / Sign up

Export Citation Format

Share Document