{"entities":{"Q1822491":{"pageid":1833233,"ns":120,"title":"Item:Q1822491","lastrevid":69237645,"modified":"2026-04-13T05:40:31Z","type":"item","id":"Q1822491","labels":{"en":{"language":"en","value":"Pseudosimulation: an algorithm for distributed simulation with limited memory"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4003513"}},"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":"Q1822491$1553D135-A8E8-4C38-A73A-A2BA038D4525","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"466d390813c33b4256008ca4e0f68ac95b19ce17","datavalue":{"value":{"text":"Pseudosimulation: an algorithm for distributed simulation with limited memory","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1822491$2574F7A2-4FD7-4EFD-A91A-EE9E1B370CEF","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"e001c176d66f2a4ba21ae7ed77fef5308705a3a2","datavalue":{"value":"0618.68028","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1822491$C52D66D9-8567-43AB-A1BA-5ABC74CDC5FF","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"86607db835a822a2047eadb45b0694ea12f2cd1d","datavalue":{"value":"10.1007/BF01414465","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1822491$958A6CD6-762A-465A-A8B5-25F9272026E6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f72900829ba40e151b558f042dccd56f696f7693","datavalue":{"value":{"entity-type":"item","numeric-id":757099,"id":"Q757099"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1822491$B4A25B6D-AD3C-46BF-A45A-C6178C10FC84","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bf4c8299bf67131876a87f7e8254782e2efbda3b","datavalue":{"value":{"entity-type":"item","numeric-id":696980,"id":"Q696980"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1822491$D5096FB6-9A68-4BBB-886E-4D5AC50D9CDF","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"a32831c4e3f60d79ea2f79afb884ef69e4c8191c","datavalue":{"value":{"entity-type":"item","numeric-id":199286,"id":"Q199286"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1822491$57777BEC-9E8B-47FD-8F3B-BEF051DAC1B8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"63df7153432d81fa42019fcabb076c89649b0b5b","datavalue":{"value":{"time":"+1986-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":"Q1822491$1E087E08-08CD-46F6-B6CE-597822E618A0","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"515e3587e8cd659c9466be565801ed470b0eebb3","datavalue":{"value":"In this paper we present a new algorithm for the distributed simulation of systems that may be modeled as a network of processes which exchange event messages (e.g. computer networks, telephone systems). We focus upon the case of fully distributed processes with limited memory available to simulate each process. The synchronization algorithm employed is a blocking algorithm. The simulation of different processes is allowed to proceed in parallel until deadlock occurs, at which time a deadlock- breaking algorithm is invoked as in the Chandy/Misra scheme. A central controller is employed to detect and aid in the efficient resolution of deadlocks. We solve some problems which were not clearly addressed in the Chandy/Misra scheme. Our deadlock-breaking algorithm, christened Pseudosimulation, is a ''look-ahead'' algorithm, which undertakes to fill empty buffers with future event messages. Correctness and termination of the algorithm are proven. An analysis of the memory requirements and running is performed. A lower bound on the memory requirements is also established which simplifies the deadlock-breaking algorithm.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1822491$4BD12AA1-E9DD-4A2C-911E-633B2BB84CAF","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ec3769495799f08479987ac368adf64f125a2b66","datavalue":{"value":"68N25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1822491$E574C404-7855-438A-BA5B-D3747B0D4A98","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6a2fcf3bd3084f56892539e81ccfb85326e04daf","datavalue":{"value":"4003513","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1822491$03605D28-6CC2-4577-AFC6-B5FD117039BC","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"09b99ae733070d3d1855ae2b169bdb873a71f7e3","datavalue":{"value":"concurrent processes","type":"string"},"datatype":"string"},"type":"statement","id":"Q1822491$36036A5D-359D-4AAF-A693-5C04663C3F31","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7b69e668aa51501f26d65b933beaacdacb426935","datavalue":{"value":"message communicating processes","type":"string"},"datatype":"string"},"type":"statement","id":"Q1822491$55EC58ED-7AFE-4174-AB2D-D07D99C6FE44","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"86aa3af01fbd39a2e6372ac3232448642d50f2a7","datavalue":{"value":"deadlock detection and recovery","type":"string"},"datatype":"string"},"type":"statement","id":"Q1822491$C3E37BAB-1A6C-4404-945E-D67445F1AC98","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2f7aeef878e1bb754e945ea5bdbd7fc84b40a876","datavalue":{"value":"network of processes which exchange event messages","type":"string"},"datatype":"string"},"type":"statement","id":"Q1822491$96F1C683-8766-466F-A0F8-9394A2B29056","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"02c7dc1956acbfd66ba52af9e3b0d5062e29a32d","datavalue":{"value":"fully distributed processes","type":"string"},"datatype":"string"},"type":"statement","id":"Q1822491$0226BD66-A252-4CC8-B706-3F7E024DC5F9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9fa36130e82077da1500a611dfdd0f247e985b15","datavalue":{"value":"synchronization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1822491$AB8D93AC-34C9-4A27-8B72-8F55C4EB6D68","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a7275c515fb963d2fcb4680bcb9a0f402d8999d3","datavalue":{"value":"blocking algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1822491$CDB4B0EE-29D3-4CB9-9957-93E06FAA1372","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bc58eddcd131f676c8facc3a04f9c19a3170f2e3","datavalue":{"value":"deadlock- breaking algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1822491$EACD3715-3B58-4877-A9B2-B8D1D57717D2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c166c77611aa2e2f400f589410ff7ac39e5564b0","datavalue":{"value":"Correctness","type":"string"},"datatype":"string"},"type":"statement","id":"Q1822491$BDCD1E50-5B84-479B-9742-99762B12DE4A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4befa4ca20f2beabcfa09e8a92ae13c21cb4934a","datavalue":{"value":"termination","type":"string"},"datatype":"string"},"type":"statement","id":"Q1822491$8CDA97F9-9093-47E0-BBD4-A643D1F35B3A","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":"Q1822491$F364A5C9-F896-49CA-AA9D-790C8DD3ACF7","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"71c734d797d1f4b152cb8689299f989908e205cc","datavalue":{"value":{"entity-type":"item","numeric-id":1142590,"id":"Q1142590"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1822491$CD7CFB4E-8192-45C7-8BCF-DBC5D2D50335","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"666b9c90870c250523d70fca63aa895e6d69b3c4","datavalue":{"value":{"entity-type":"item","numeric-id":1923863,"id":"Q1923863"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"24adbb4a645b0b8d56e33bc5fae466c166e30dd0","datavalue":{"value":{"amount":"+0.86361086","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1822491$BCF38D37-B09C-42B7-A088-5FCDF89F46A0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"665fa20e5f6ae1a6224dd56f502d246bff3f3e6f","datavalue":{"value":{"entity-type":"item","numeric-id":1194808,"id":"Q1194808"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"db3638b883c1b8b31233583c56d286078ff30fd4","datavalue":{"value":{"amount":"+0.8582176","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1822491$19086B18-8DDB-477F-8712-08BE41905230","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d5473750f941dd0f8afa2243fcedd80c283fda00","datavalue":{"value":{"entity-type":"item","numeric-id":679435,"id":"Q679435"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"69e13878ac3cd6a05390010514fe50dbb698313b","datavalue":{"value":{"amount":"+0.8574959","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1822491$EA4B5E5A-D737-4BAE-8E88-571ADD111F65","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"4d3d2e9a8650fcbb8efba0eaadc23e74c138fefa","datavalue":{"value":{"entity-type":"item","numeric-id":1194817,"id":"Q1194817"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d23177a052db6d9c56ce6407337cce90044f9d97","datavalue":{"value":{"amount":"+0.84589744","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1822491$3BA69998-F296-4DED-8A06-98BE3B84C6D6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8fedba4c4b0c0dd93e20007e7744b0404f6796a7","datavalue":{"value":{"entity-type":"item","numeric-id":2744178,"id":"Q2744178"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"dcabb8322085650dd97147a711bb7f5dda87c055","datavalue":{"value":{"amount":"+0.8422991","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1822491$9DCC4473-5B65-4963-83DF-C0C92FBC60CB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"229a065edd0fb7469799682df5a71c8aa4cdc1f3","datavalue":{"value":{"entity-type":"item","numeric-id":4876097,"id":"Q4876097"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f6bb968e36fb86bb951a4c31246412167e294f58","datavalue":{"value":{"amount":"+0.8405493","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1822491$436A5069-C6BE-463A-B5B4-9431D9C41235","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2987047877bf4201dd1968ff1bf87246cce1c187","datavalue":{"value":{"entity-type":"item","numeric-id":5138357,"id":"Q5138357"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"bf51228092eb44a6c7341c21d9e4e7dac45fe115","datavalue":{"value":{"amount":"+0.83756655","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1822491$DCBF6FF9-3BAE-414D-8912-75D80965B676","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f402e507b76fe9dfbb59a6d73007dcd5b8f63fe0","datavalue":{"value":{"entity-type":"item","numeric-id":5245929,"id":"Q5245929"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"1cf208d0a0deadeb1188bd5915b5a196723920b3","datavalue":{"value":{"amount":"+0.8372841","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1822491$EC6E07DC-43F8-4C5E-ABEE-3D38834FF925","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Pseudosimulation: an algorithm for distributed simulation with limited memory","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Pseudosimulation:_an_algorithm_for_distributed_simulation_with_limited_memory"}}}}}