{"entities":{"Q1111010":{"pageid":1121759,"ns":120,"title":"Item:Q1111010","lastrevid":69666792,"modified":"2026-04-13T08:34:32Z","type":"item","id":"Q1111010","labels":{"en":{"language":"en","value":"A new algorithm for deadlock avoidance"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4074458"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111010$A9AE0995-1299-4550-88A1-D28FFEFABE8D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1cfd6cc7d91951d5aed3650c187826fe8d2950b8","datavalue":{"value":{"text":"A new algorithm for deadlock avoidance","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1111010$2E79FCBE-B440-4818-8BCF-A220A049DD3D","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"62d83313e92907b651edd79ada8658e1fcf4e794","datavalue":{"value":"0657.68020","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111010$03D900FB-6F86-4B68-A0C3-A6A03EB96D06","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"9bbaad9e94ac16609a2d969d95975ce5442e68d8","datavalue":{"value":"10.1016/0020-0255(88)90018-7","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111010$53A66B5A-777A-4910-B8A5-60079AC0EA7B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"520b46455f76f3099eb3ea310c6eef9d5346321e","datavalue":{"value":{"entity-type":"item","numeric-id":264565,"id":"Q264565"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111010$DB40041E-448A-4B02-BE4A-C30CB45C71D0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"12ed790e08140c91b49e7aa04dc9aed3050c8650","datavalue":{"value":{"entity-type":"item","numeric-id":391986,"id":"Q391986"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111010$577893FD-F11C-45AC-823B-83662FC0FDB6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"836c2539e7e4d86cd2384017c8b0b2a8582a9b49","datavalue":{"value":{"entity-type":"item","numeric-id":1111009,"id":"Q1111009"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111010$2FCABAB6-9518-41AB-B880-D344B8A7D7A2","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"c144f0fb88440afe4b13555aedcc8676a016b6d2","datavalue":{"value":{"entity-type":"item","numeric-id":70466,"id":"Q70466"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111010$06095CC6-CE01-418C-932E-85ABC7AEEDEA","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"31a1937240ca4a323604b4728c31d242b5596d7c","datavalue":{"value":{"time":"+1988-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1111010$31617E53-D92E-40A7-BDAA-57EA83ED864F","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"3b8654201fbe839dd242c246cb6dbc6e910b62c8","datavalue":{"value":"This paper presents an algorithm for deadlock avoidance in a resource sharing environment with multiple types of resources, where the maximum claims of the individual processes are unknown a priori. A new copy of process ordering is introduced in place of resource ordering. We also present a preallocation algorithm for predicting the requests that could be granted. This predictor process runs on the fly with the underlying computation of the system. The resource manager runs a preallocation algorithm when it is idle (does not receive messages from the processes) or when the processes request for resources but the possibility of allocations has not been evaluated. The deadlock avoidance and the preallocation algorithms are suitable for both centralized and distributed systems.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111010$22CC4B37-9226-4F29-A3C1-545BBB8DB06C","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ec3769495799f08479987ac368adf64f125a2b66","datavalue":{"value":"68N25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111010$33AC2D4A-4B43-465E-B4EE-5066A8DFCFE9","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b27f3d2e94bf617909aa4d9a7c43c9855dad577a","datavalue":{"value":"4074458","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111010$5566D2C1-0967-4A7B-AD58-999BB99C7743","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ad03cda938d8cc8bcb3fb4a6a15160128fca9577","datavalue":{"value":"centralized systems","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111010$4AC11721-A39E-4CF2-8576-D6FE7A61D45D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f82d9744537c8929843a9f698e900cd31ff81587","datavalue":{"value":"distributed systems","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111010$FE1E52F7-96F1-4766-9359-535BE3AE1066","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"08c70abc74354f81e14c1950aab27c1fd80288d6","datavalue":{"value":"deadlock avoidance","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111010$1FEE31A9-F33E-4DE7-933F-7BD35571AE69","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9d3337f13bea01e4fb5e9f1b1ca25f76ee718847","datavalue":{"value":"resource sharing environment","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111010$F68109B6-2EE6-46E4-A0EE-FB9D56F4F324","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3b9c35ce6fcdfc86d65d786c29538ad6159bb397","datavalue":{"value":"process ordering","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111010$C2E010D1-A970-4E76-9333-A478437D3A35","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8629839087e66aed22476dfe741d338cdf232b21","datavalue":{"value":"preallocation algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111010$FEEFE900-2575-48A3-B2B9-43325745CDB4","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111010$6101FA9E-9E60-46BD-AC1E-7D56A6E4687F","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"79aa1b4a1f632f511df1b33fba9cdaa3329d633e","datavalue":{"value":"https://doi.org/10.1016/0020-0255(88)90018-7","type":"string"},"datatype":"url"},"type":"statement","id":"Q1111010$A4F5CD67-CE9A-4C70-A34A-7116AEA4070D","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"91583fbdc66739ac2399cb6d8a22a30eb9394e10","datavalue":{"value":"W2068193361","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111010$1C4474EE-51C5-43CF-ACD1-7EB110223ED7","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"e44869c61c83d952c42bca31f4480add28534404","datavalue":{"value":{"entity-type":"item","numeric-id":5563096,"id":"Q5563096"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111010$BE70C5DD-C030-45C3-9611-23181A8BFE5D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"8ad9439ba540e1eafe7096c665de877fa653beb8","datavalue":{"value":{"entity-type":"item","numeric-id":5576027,"id":"Q5576027"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111010$24794DD9-B5E9-4D9E-9414-86C91B5264DA","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"463e54aa6e83ba682549c4fcd0253c534e99bc7d","datavalue":{"value":{"entity-type":"item","numeric-id":1091127,"id":"Q1091127"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"47a9834400c592ec4e9076bbd00725ff2dad39d5","datavalue":{"value":{"amount":"+0.7819364070892334","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1111010$875555CA-C4B4-4BAD-A637-FACA03783A6F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d117a35bd6a5c64f3cfb75257c8cc3d1a3635ff5","datavalue":{"value":{"entity-type":"item","numeric-id":4021772,"id":"Q4021772"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5cdaa10d737d9a5fce295760264713bbaa251c09","datavalue":{"value":{"amount":"+0.7767815589904785","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1111010$2B56E3CB-FFE0-4D9A-ACB3-7D7D9AFBA908","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f12eb621a9a4b427d55faa27cf8b75ecb1f81a49","datavalue":{"value":{"entity-type":"item","numeric-id":796982,"id":"Q796982"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"741e0d2bc9134b7aa8ff6eb37cc222531fb64e07","datavalue":{"value":{"amount":"+0.7653383612632751","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1111010$59EF495F-819D-48EB-A798-0E4686E3DBC6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"c683a9bcaae0c642c27981513aebbfe770f91a34","datavalue":{"value":{"entity-type":"item","numeric-id":1075049,"id":"Q1075049"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5f4e3882d859bb2e3ffbad6cd09d78b5e645eb36","datavalue":{"value":{"amount":"+0.7625024914741516","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1111010$B9793E83-B261-4807-8804-1FDA2AEECF1F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"36bc7bc5a0ae224ef33329dd40a9e70e19c740fd","datavalue":{"value":{"entity-type":"item","numeric-id":1100883,"id":"Q1100883"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a1ae91e7505f3b699630c60801627d3b82bf6fba","datavalue":{"value":{"amount":"+0.7602888345718384","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1111010$E0FDA545-05A4-4A64-B4CA-3B1EC0577AA8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A new algorithm for deadlock avoidance","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_new_algorithm_for_deadlock_avoidance"}}}}}