A Flexible Dynamic Partitioning Algorithm for Optimistic Distributed Simulation

2007 ◽  
Author(s):  
Patrick Peschlow ◽  
Tobias Honecker ◽  
Peter Martini
Keyword(s):  
Distributed Simulation ◽  
Dynamic Partitioning ◽  
Partitioning Algorithm

scholarly journals A Dynamic Plane Prediction Method Using the Extended Frame in Smart Dust IoT Environments

Sensors ◽  
2020 ◽  
Vol 20 (5) ◽  
pp. 1364 ◽  
Author(s):  
Joonsuu Park ◽  
KeeHyun Park
Keyword(s):  
Learning Algorithm ◽  
Prediction Method ◽  
Training Data ◽  
Next Generation ◽  
Computing Power ◽  
Data Packets ◽  
Dynamic Partitioning ◽  
Smart Dust ◽  
Partitioning Algorithm ◽  
And Control

Internet of Things (IoT) technologies are undeniably already all around us, as we stand at the cusp of the next generation of IoT technologies. Indeed, the next-generation of IoT technologies are evolving before IoT technologies have been fully adopted, and smart dust IoT technology is one such example. The concept of smart dust IoT technology, which features very small devices with low computing power, is a revolutionary and innovative concept that enables many things that were previously unimaginable, but at the same time creates unresolved problems. One of the biggest problems is the bottlenecks in data transmission that can be caused by this large number of devices. The bottleneck problem was solved with the Dual Plane Development Kit (DPDK) architecture. However, the DPDK solution created an unexpected new problem, which is called the mixed packet problem. The mixed packet problem, which occurs when a large number of data packets and control packets mix and change at a rapid rate, can slow a system significantly. In this paper, we propose a dynamic partitioning algorithm that solves the mixed packet problem by physically separating the planes and using a learning algorithm to determine the ratio of separated planes. In addition, we propose a training data model eXtended Permuted Frame (XPF) that innovatively increases the number of training data to reflect the packet characteristics of the system. By solving the mixed packet problem in this way, it was found that the proposed dynamic partitioning algorithm performed about 72% better than the general DPDK environment, and 88% closer to the ideal environment.

Thread Partitioning Algorithm for Speculative Multithreading Based on Path Optimization

2012 ◽  
Vol 23 (8) ◽  
pp. 1950-1964 ◽  
Author(s):  
Yuan-Cheng LI ◽  
Yin-Liang ZHAO ◽  
Mei-Rong LI ◽  
Yan-Ning DU
Keyword(s):  
Path Optimization ◽  
Speculative Multithreading ◽  
Partitioning Algorithm ◽  
Thread Partitioning
Sign in / Sign up

Export Citation Format

Share Document