Optimization Algorithms for Data Transfer in the Grid Environment

2012 ◽  
pp. 502-516
Author(s):  
Muzhou Xiong ◽  
Hai Jin

In this chapter, two algorithms have been presented for supporting efficient data transfer in the Grid environment. From a node’s perspective, a multiple data transfer channel can be formed by selecting some other nodes as relays in data transfer. One algorithm requires the sender to be aware of the global connection information while another does not. Experimental results indicate that both algorithms can transfer data efficiently under various circumstances.

Author(s):  
Muzhou Xiong ◽  
Hai Jin

In this chapter, two algorithms have been presented for supporting efficient data transfer in the Grid environment. From a node’s perspective, a multiple data transfer channel can be formed by selecting some other nodes as relays in data transfer. One algorithm requires the sender to be aware of the global connection information while another does not. Experimental results indicate that both algorithms can transfer data efficiently under various circumstances.


Sensors ◽  
2021 ◽  
Vol 21 (22) ◽  
pp. 7573
Author(s):  
Juan M. Romero-Arguello ◽  
Anh-Vu Pham ◽  
Christopher S. Gardner ◽  
Brad T. Funsten

This paper presents the design and development of miniature coils for wireless power and data transfer through metal. Our coil has a total size of 15 mm × 13 mm × 6 mm. Experimental results demonstrate that we can harvest 440 mW through a 1 mm-thick aluminum plate. Aluminum and stainless-steel barriers of different thicknesses were used to characterize coil performance. Using a pair of the designed coils, we have developed a through-metal communication system to successfully transfer data through a 1 mm-thick aluminum plate. A maximum data rate of 100 bps was achieved using only harvested power. To the best of our knowledge, this is the first report that demonstrates power and data transfer through aluminum using miniature coils.


2021 ◽  
Vol 13 (7) ◽  
pp. 1367
Author(s):  
Yuanzhi Cai ◽  
Hong Huang ◽  
Kaiyang Wang ◽  
Cheng Zhang ◽  
Lei Fan ◽  
...  

Over the last decade, a 3D reconstruction technique has been developed to present the latest as-is information for various objects and build the city information models. Meanwhile, deep learning based approaches are employed to add semantic information to the models. Studies have proved that the accuracy of the model could be improved by combining multiple data channels (e.g., XYZ, Intensity, D, and RGB). Nevertheless, the redundant data channels in large-scale datasets may cause high computation cost and time during data processing. Few researchers have addressed the question of which combination of channels is optimal in terms of overall accuracy (OA) and mean intersection over union (mIoU). Therefore, a framework is proposed to explore an efficient data fusion approach for semantic segmentation by selecting an optimal combination of data channels. In the framework, a total of 13 channel combinations are investigated to pre-process data and the encoder-to-decoder structure is utilized for network permutations. A case study is carried out to investigate the efficiency of the proposed approach by adopting a city-level benchmark dataset and applying nine networks. It is found that the combination of IRGB channels provide the best OA performance, while IRGBD channels provide the best mIoU performance.


2012 ◽  
Vol E95.D (12) ◽  
pp. 2852-2859
Author(s):  
Yutaka KAWAI ◽  
Adil HASAN ◽  
Go IWAI ◽  
Takashi SASAKI ◽  
Yoshiyuki WATASE
Keyword(s):  

2010 ◽  
Vol 2 (1) ◽  
pp. 34-50 ◽  
Author(s):  
Nikolaos Preve

Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this article is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms.


2018 ◽  
Vol 7 (3.12) ◽  
pp. 706
Author(s):  
R Sivasubramanian ◽  
K Arthi

Grid Computing is becoming the rising procedure in this ongoing condition. System figuring is the social affair of PC resources from various territories to accomplish a run of the mill objective. The framework can be considered as a spread structure with non-instinctive workloads that incorporate innumerable, the multi-grid environment which provides the multi-tenancy startup for the multiple inputs that is transmitted in the form of the data. The routing strategy which provides the robust reallocation in the grid environment. This paper proposes a Strategic Multi-Reallocation procedure which makes the reallocation in the multi-grid environment. We Propose the Grid-Hadlock Algorithm for the efficient reallocation in the multi-grid environment. The implementation proves the maximum occupancy and its reallocation strategies more efficient. The experimental results proves the phenomenon is more efficient.  


2007 ◽  
Vol 10-12 ◽  
pp. 456-459 ◽  
Author(s):  
B. Yuan ◽  
Wei Xiong ◽  
Zu Wen Wang

Virtual prototype technology could integrate different CAD formats parts into an digital model. In this way the design process will be more efficient. This issue reviewed three methods to transfer data from CAD parts to virtual reality element. And find an efficient way to transfer different CAD model data to virtual prototype software Division MockUp.


Sign in / Sign up

Export Citation Format

Share Document