Prevention of Store-and-Forward Deadlock in Computer Networks

Much previous work has been done on the prevention of store-and-forward deadlock in computer networks using buffer reservation. The emphasis has been on reducing the number of reserved buffers necessary in each node. In this paper, we propose a scheme that, for most networks, will guarantee deadlock...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on communications Vol. 33; no. 12; pp. 1258 - 1264
Main Author Gopal, I.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.01.1985
Institute of Electrical and Electronics Engineers
Subjects
Applied sciences
Buffer storage
Communication system traffic control
Computer networks
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Data communication
Exact sciences and technology
Intelligent networks
Microcomputers
Routing
Societies
Software
System recovery
Throughput
Partition
Packet switching
Deadtime
Computer network
Computer
Plug
Data transmission
Online AccessGet full text

Cover

More Information
Summary:Much previous work has been done on the prevention of store-and-forward deadlock in computer networks using buffer reservation. The emphasis has been on reducing the number of reserved buffers necessary in each node. In this paper, we propose a scheme that, for most networks, will guarantee deadlock freedom for any arbitrary routing with a third fewer reserved buffers than the best previously proposed scheme.
Bibliography:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOM.1985.1096253