Cart (Loading....) | Create Account
Close category search window
 

Performance evaluation of traffic congestion for multiple-lock checking algorithm in distributed share virtual environment applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Olarn Wongwirat ; Fac. of Inf. Technol., King Mongkut''s Inst. of Technol., Bangkok, Thailand ; Sathitwiriyawong, C. ; Ohara, S.

Multiple-lock checking algorithm has been studied and developed to support simultaneous access of shared resources, or objects, by logical processes of applications in distributed shared virtual environment for two years. Its purpose is to provide synchronization among the logical processes in a networked virtual environment where users' applications can interact with each other in the shared environment. There are two main factors effecting performance of the multiple-lock checking mechanism in the distributed share virtual environment application, which are network delay and traffic. The former factor has been issued in our previous work. This paper verifies the traffic congestion on local network (LAN) that is generated by the number of logical processes. The effect of increased traffic to the performance of multiple-lock checking algorithm when accessing the shared object in the shared virtual environment application is also investigated. Simulation results show that utilization of the local network to support the locking mechanism for non-competition case is insignificant comparing with the number of logical processes. The locking time for distinct logical processes is constant and below 100 μs at lower 60% workload condition. Finally, the multiple-lock checking algorithm can perform efficiently on the LAN with no traffic affecting the performance

Published in:

TENCON 2001. Proceedings of IEEE Region 10 International Conference on Electrical and Electronic Technology  (Volume:1 )

Date of Conference:

2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.