The Banker's problem with precedences

Georgakopoulos, G; Kavadias, D

dc.contributor.author	Georgakopoulos, G	en
dc.contributor.author	Kavadias, D	en
dc.date.accessioned	2014-03-01T01:08:10Z
dc.date.available	2014-03-01T01:08:10Z
dc.date.issued	1990	en
dc.identifier.issn	0890-5401	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10309
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0025244712&partnerID=40&md5=145ab91e99b95fcf46284f97ff22b81e	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.other	Computer Metatheory--Computability and Decidability	en
dc.subject.other	Computer Programming--Algorithms	en
dc.subject.other	Banker's Problem	en
dc.subject.other	Deadlock Avoidance	en
dc.subject.other	NP Completeness	en
dc.subject.other	Computer Systems, Digital	en
dc.title	The Banker's problem with precedences	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1990	en
heal.abstract	Several interesting generalizations of the Banker's problem, as a deadlock avoidance problem, are examined. We first allow each task to return after its execution, more resource units than it requires or vice versa. We allow precedences between the tasks which partially define the order of execution, and finally we allow resources of more than one kind. We prove that the problem becomes NP-complete in the two latter cases and we present two interesting subcases (among them the subcase where the precedences have a ""forest"" structure), where it can be solved in polynomial time. © 1990.	en
heal.publisher	ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS	en
heal.journalName	Information and Computation	en
dc.identifier.isi	ISI:A1990CK40200001	en
dc.identifier.volume	84	en
dc.identifier.issue	1	en
dc.identifier.spage	1	en
dc.identifier.epage	12	en