Baked potatoes: deadlock prevention via scheduling

Shlomi Dolev; Evangelos Kranakis; Danny Krizanc

doi:10.1145/248052.248093

Baked potatoes: deadlock prevention via scheduling

Shlomi Dolev, Evangelos Kranakis, Danny Krizanc

Department of Computer Science

Research output: Contribution to conference › Paper › peer-review

3 Scopus citations

Abstract

This paper identifies the equivalence of deadlock prevention in store-and-forward communication networks and simultaneous arrival of packets to a switch of bufferless highspeed networks. Scheduling of packet transmission schemes, called baked-potato schemes, are used to avoid simultaneous arrival of packets to a switch. Scheduling schemes are presented for any capacity links and switches. They are evaluated by maximal length of time between two successive schedulings of a processor. It is shown that baked-potato scheme does not assume any prior knowledge on the source destination demands and can be used for sending control packets and broadcasting.

Original language	English
Pages	210
Number of pages	1
DOIs	https://doi.org/10.1145/248052.248093
State	Published - 1 Jan 1996
Event	Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing - Philadelphia, PA, USA Duration: 23 May 1996 → 26 May 1996

Conference

Conference	Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing
City	Philadelphia, PA, USA
Period	23/05/96 → 26/05/96

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1145/248052.248093

Cite this

@conference{7a89e02b5f564339a97eaf4e8dcf0692,

title = "Baked potatoes: deadlock prevention via scheduling",

abstract = "This paper identifies the equivalence of deadlock prevention in store-and-forward communication networks and simultaneous arrival of packets to a switch of bufferless highspeed networks. Scheduling of packet transmission schemes, called baked-potato schemes, are used to avoid simultaneous arrival of packets to a switch. Scheduling schemes are presented for any capacity links and switches. They are evaluated by maximal length of time between two successive schedulings of a processor. It is shown that baked-potato scheme does not assume any prior knowledge on the source destination demands and can be used for sending control packets and broadcasting.",

author = "Shlomi Dolev and Evangelos Kranakis and Danny Krizanc",

year = "1996",

month = jan,

day = "1",

doi = "10.1145/248052.248093",

language = "English",

pages = "210",

note = "Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing ; Conference date: 23-05-1996 Through 26-05-1996",

}

TY - CONF

T1 - Baked potatoes

T2 - Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing

AU - Dolev, Shlomi

AU - Kranakis, Evangelos

AU - Krizanc, Danny

PY - 1996/1/1

Y1 - 1996/1/1

N2 - This paper identifies the equivalence of deadlock prevention in store-and-forward communication networks and simultaneous arrival of packets to a switch of bufferless highspeed networks. Scheduling of packet transmission schemes, called baked-potato schemes, are used to avoid simultaneous arrival of packets to a switch. Scheduling schemes are presented for any capacity links and switches. They are evaluated by maximal length of time between two successive schedulings of a processor. It is shown that baked-potato scheme does not assume any prior knowledge on the source destination demands and can be used for sending control packets and broadcasting.

AB - This paper identifies the equivalence of deadlock prevention in store-and-forward communication networks and simultaneous arrival of packets to a switch of bufferless highspeed networks. Scheduling of packet transmission schemes, called baked-potato schemes, are used to avoid simultaneous arrival of packets to a switch. Scheduling schemes are presented for any capacity links and switches. They are evaluated by maximal length of time between two successive schedulings of a processor. It is shown that baked-potato scheme does not assume any prior knowledge on the source destination demands and can be used for sending control packets and broadcasting.

UR - http://www.scopus.com/inward/record.url?scp=0029703447&partnerID=8YFLogxK

U2 - 10.1145/248052.248093

DO - 10.1145/248052.248093

M3 - Paper

AN - SCOPUS:0029703447

SP - 210

Y2 - 23 May 1996 through 26 May 1996

ER -

Baked potatoes: deadlock prevention via scheduling

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this