•   Home
  • Proceedings
  • National Teaching Symposium on Cryptology and Information Se...

National Teaching Symposium on Cryptology and Information Security (NTSCIS 2010 E-BOOK)

Kunming,China,8.8-8.9，2010

ISBN: 978-1-935068-09-9 Scientific Research Publishing, USA

E-Book 469pp Pub. Date: August 2010

Category: Computer Science & Communications

Price: $80

Title: Dynamic Optimal Algorithms Based on Buffers for Store-Forward Deadlock Avoidance
Source: National Teaching Symposium on Cryptology and Information Security (NTSCIS 2010 E-BOOK) (pp 102-106)
Author(s): Ce Fan, Faculty of Information Science and Technology, Guangdong University of Foreign Studies, GuangZhou, China
Abstract: A problem of deadlock avoidance in store - forward networks with at least two buffers pernode for network communication and distributed and dynamic routing path is presented. It is discussedon message switching among the nodes of directed and no direction graph. Also the buffers used in allnodes throughout network communication and the safe state of the system are focused on the algorithm.deadlock –free algorithms proposed is optimal in the sense of possible buffers utilization, and the proofand conditions are shown for deadlock-free. The algorithm and procedure of flow control of the optimaland deadlock–free are proposed based on at least two buffers per node. The complexity of algorithmsapplied in searching is equal to that of Depth-First Search on graph. It has O(|E|) time complexity foreach dynamic transmission step. It is very important and profitable for the problem of parallelcomputation processing, network communication and distributed systems.
Proceedings by Subjects
Resources
Products
Contact us
book@scirp.org
WhatsApp +86 18163351462(WhatsApp)
Click here to send a message to me 1243940697
Book Publishing WeChat
Follow SCIRP
Free SCIRP Newsletters
Copyright © 2006-2024 Scientific Research Publishing Inc. All Rights Reserved.
Top