A Cooperative Cell Model in Computational Mobile Grid

2012 ◽  
Vol 8 (1) ◽  
pp. 19-36 ◽  
Author(s):  
Achal Kaushik ◽  
Deo P. Vidyarthi
Keyword(s):  
Wireless Channels ◽  
Simulation Experiment ◽  
Cell Model ◽  
User Mobility ◽  
Grid Environment ◽  
Mobile Grid ◽  
Efficient Management ◽  
Current Cell ◽  
Proposed Model ◽  
Grid Nodes

Computation in the mobile grid nodes under the cellular network environment requires an efficient management of wireless channels along with the user mobility. Due to random movement of the mobile devices, the load over the cells in terms of initiation of new computation or carryover computation (handoff) may vary dynamically. This may result in non-availability of free channels for Inter-task communication leading in the drop of carryover computation or to initiate the new computation in the current cell. The proposed work designs a model by instigating substantive cooperation among underutilized and the overloaded cells, considering importance to the frequency reuse and assigning priority to the on-going computation in the computational mobile grid. The model seeks cooperation by grouping the cells in different sizes to reduce the blocking and dropping of the computation. Blocking of the communication is very serious in computational mobile grid environment as the drop may result in the termination of the computation. The model aims at minimizing the Call Block Probability (CBP) and Call Drop Probability (CDP) in the mobile grid by making the clusters of different sizes. A simulation experiment to evaluate the performance of the proposed model reveals the effectiveness of this model.

scholarly journals AOIO: Application Oriented I/O Optimization for Buffer Management

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 573
Author(s):  
Xiaochang Li ◽  
Zhengjun Zhai ◽  
Xin Ye
Keyword(s):  
System Performance ◽  
Simulation Experiment ◽  
Buffer Management ◽  
Input Output ◽  
Output Data ◽  
Program Counter ◽  
Efficient Management ◽  
Management Scheme ◽  
Buffer Cache ◽  
Management Schemes

Emerging scale-out I/O intensive applications are broadly used now, which process a large amount of data in buffer/cache for reorganization or analysis and their performances are greatly affected by the speed of the I/O system. Efficient management scheme of the limited kernel buffer plays a key role in improving I/O system performance, such as caching hinted data for reuse in future, prefetching hinted data, and expelling data not to be accessed again from a buffer, which are called proactive mechanisms in buffer management. However, most of the existing buffer management schemes cannot identify data reference regularities (i.e., sequential or looping patterns) that can benefit proactive mechanisms, and they also cannot perform in the application level for managing specified applications. In this paper, we present an A pplication Oriented I/O Optimization (AOIO) technique automatically benefiting the kernel buffer/cache by exploring the I/O regularities of applications based on program counter technique. In our design, the input/output data and the looping pattern are in strict symmetry. According to AOIO, each application can provide more appropriate predictions to operating system which achieve significantly better accuracy than other buffer management schemes. The trace-driven simulation experiment results show that the hit ratios are improved by an average of 25.9% and the execution times are reduced by as much as 20.2% compared to other schemes for the workloads we used.

scholarly journals Research on Analysis Method of Traffic Congestion Mechanism Based on Improved Cell Transmission Model

2012 ◽  
Vol 2012 ◽  
pp. 1-11 ◽  
Author(s):  
Hongzhao Dong ◽  
Shuai Ma ◽  
Mingfei Guo ◽  
Dongxu Liu
Keyword(s):  
Traffic Flow ◽  
Traffic Congestion ◽  
Road Network ◽  
Simulation Experiment ◽  
Transmission Model ◽  
Spatial Diffusion ◽  
Cell Transmission Model ◽  
Analysis Method ◽  
Proposed Model ◽  
Cell Transmission

To analyze the spreading regularity of the initial traffic congestion, the improved cell transmission model (CTM) is proposed to describe the evolution mechanism of traffic congestion in regional road grid. Ordinary cells and oriented cells are applied to render the crowd roads and their adjacent roads. Therefore the traffic flow could be simulated by these cells. Resorting to the proposed model, the duration of the initial traffic congestion could be predicted and the subsequent secondary congestion could be located. Accordingly, the spatial diffusion of traffic congestion could be estimated. At last, taking a road network region of Hangzhou city as an example, the simulation experiment is implemented to verify the proposed method by PARAMICS software. The result shows that the method could predict the duration of the initial congestion and estimate its spatial diffusion accurately.

Orchestration and Workflow in a mobile Grid environment

2006 ◽  
Author(s):  
Annalisa Terracina ◽  
Stefano Beco ◽  
Tom Kirkham ◽  
Julian Gallop ◽  
Ian Johnson ◽  
...  
Keyword(s):  
Grid Environment ◽  
Mobile Grid

scholarly journals Self-adaptive structuring for P2P-based large-scale Grid environment

2016 ◽  
Vol Volume 25 - 2016 - Special... ◽  
Author(s):  
Bassirou Gueye ◽  
Olivier Flauzac ◽  
Cyril Rabat ◽  
Ibrahima Niang
Keyword(s):  
Large Scale ◽  
Virtual Communities ◽  
Resource Discovery ◽  
Nous Proposons ◽  
Grid Environment ◽  
Système D’Information ◽  
Large Scale Grid ◽  
Grid Nodes ◽  
Scale Grid ◽  
Self Adaptive

In this paper, we propose an extension and experimental evaluation of our self-adaptive structuring solution in an large-scale P2P Grid environment. The proposed specification, enables both services deployment, location and invocation of while respecting the P2P networks paradigm. Moreover, the specification is generic i.e. not linked to a particular P2P architecture. The increasing size of resources and users in large-scale distributed systems has lead to a scalability problem. To ensure the scalability, we propose to organize the P2P grid nodes in virtual communities. A particular node called ISP (Information System Proxy) acts as service directory within each cluster. On the other hand, resource discovery is one of the essential challenges in large-scale Grid environment. In this sense, we propose to build a spanning tree which will be constituted by the set of formed ISPs in order to allow an efficient service lookup in the system. An experimental validation, through simulation, shows that our approach ensures a high scalability in terms of clusters distribution and communication cost. Dans cet article, nous proposons une extension et une implémentation de notre solution de structuration auto-adaptative dans un environnement de grilles P2P à large échelle. La spécification que nous avons proposée permet aussi bien le déploiement, la recherche et l’invocation de services tout en respectant le paradigme des réseaux P2P. De plus, elle est générique, c’est-à-dire applicable sur toute architecture pair-à-pair. Pour garantir cette propriété, étant donné que les systèmes distribués à large échelle ont tendance à évoluer en termes de ressources, d’entités et d’utilisateurs, nous proposons de structurer l’environnement de grille pair-à-pair en communautés virtuelles. Au sein de chaque communauté un noeud appelé PSI (Proxys Système d’Information) joue le rôle de registre de services. Afin de permettre une recherche efficace dans le système, un arbre couvrant constitué uniquement des PSI est maintenu. Les résultats de simulations ont montrés que notre solution garantitun passage à l’échelle en termes de dimensionnement du réseau et aussi de coût de recherches.

scholarly journals A Fusion-Based Hybrid-Feature Approach for Recognition of Unconstrained Offline Handwritten Hindi Characters

2021 ◽  
Vol 13 (9) ◽  
pp. 239
Author(s):  
Danveer Rajpal ◽  
Akhil Ranjan Garg ◽  
Om Prakash Mahela ◽  
Hassan Haes Alhelou ◽  
Pierluigi Siano
Keyword(s):  
Character Recognition ◽  
Large Population ◽  
Principal Component ◽  
Support Vector ◽  
Discrete Wavelet ◽  
Hybrid Features ◽  
Efficient Management ◽  
Novel Approach ◽  
Proposed Model ◽  
Machine Learning Approach

Hindi is the official language of India and used by a large population for several public services like postal, bank, judiciary, and public surveys. Efficient management of these services needs language-based automation. The proposed model addresses the problem of handwritten Hindi character recognition using a machine learning approach. The pre-trained DCNN models namely; InceptionV3-Net, VGG19-Net, and ResNet50 were used for the extraction of salient features from the characters’ images. A novel approach of fusion is adopted in the proposed work; the DCNN-based features are fused with the handcrafted features received from Bi-orthogonal discrete wavelet transform. The feature size was reduced by the Principal Component Analysis method. The hybrid features were examined with popular classifiers namely; Multi-Layer Perceptron (MLP) and Support Vector Machine (SVM). The recognition cost was reduced by 84.37%. The model achieved significant scores of precision, recall, and F1-measure—98.78%, 98.67%, and 98.69%—with overall recognition accuracy of 98.73%.

Resource Allocation and Provisioning in Computational Mobile Grid

2015 ◽  
Vol 6 (2) ◽  
pp. 1-24 ◽  
Author(s):  
Dinesh Prasad Sahu ◽  
Karan Singh ◽  
Shiv Prakash
Keyword(s):  
Resource Allocation ◽  
Mobile Devices ◽  
Mobile Agent ◽  
Fixed Number ◽  
Mobile Grid ◽  
Java Language ◽  
Computational Capability ◽  
Proposed Model ◽  
Drastic Increase

Recent years have seen drastic increase in number of mobile devices which are becoming popular not only by their communication flexibility but also for their computational capability. A collection of mobile devices together form a grid. In the proposed model, it is assumed that the set of jobs are accumulated to the primary machine, though they might have been submitted anywhere in the grid. It is also assumed that each job consists of one or more number of sub jobs. Mobile Grid comprises with number of machines and speed of execution of individual processor may be different. Each machine can handle fixed number of sub jobs. A set of jobs accumulated at the primary machines are distributed to different secondary machines. A rigorous set of experiment has been carried out by simulating the model using java language on Eclipse IDE integrated with Gridsim. The model has been tested with various numbers of inputs in different cases and result has been observed. The authors found some of the key findings of the experiments. In most of the cases, resource allocation is better when mobile agent is employed for the work.

The Study on Fire Spreading Based on Mobile Agent and Grid Technology

2014 ◽  
Vol 971-973 ◽  
pp. 1834-1837
Author(s):  
Yuan Jiang Huang ◽  
Jie Huang
Keyword(s):  
Decision Making ◽  
Problem Solving ◽  
Mobile Agent ◽  
Grid Technology ◽  
Grid Environment ◽  
Decision Making Problem ◽  
Grid Nodes ◽  
Fire Spreading ◽  
Reasoning Mechanism ◽  
Resource Decision

In order to build a truly open OpenDSS and enhance the complexity of decision-making DSS for solving the problem of Fire spreading. a new model was given based on mobile Agent Open Decision Support System in grid environment. Making use of the intelligence of MAS and adaptive capacity, based on the reasoning mechanisms for task decomposition and resource decision-making grid matching, described in detail layer program CBR-based reasoning mechanism of the Agent and its operation flow and interactive mechanism, put the complexity of distribution of decision-making problem solving to the grid nodes on the environment, implementation of parallel asynchronous decision-making problem solving. Optimize distribution through the logistics of the problem MABODSS design, it proved to improve the system's intelligence and operational efficiency.

Sign in / Sign up

Export Citation Format

Share Document