{"entities":{"Q1106010":{"pageid":1116759,"ns":120,"title":"Item:Q1106010","lastrevid":66449784,"modified":"2026-04-12T10:09:31Z","type":"item","id":"Q1106010","labels":{"en":{"language":"en","value":"Program graph allocation in distributed multicomputers"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4060681"}},"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":"Q1106010$F5A4D07A-FF6A-4E1D-AC92-4CF7E1068A0C","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8994b3dec12227196b311d6c63973bafcae9dc43","datavalue":{"value":{"text":"Program graph allocation in distributed multicomputers","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1106010$BF423CB0-B7E9-4785-B5AC-20321ABE7CB6","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"65029a7dce9683279facaf00cae93ebf541f5a9d","datavalue":{"value":"0649.68008","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1106010$CCEA084D-4484-4F95-8CDD-10B7CE69EC6C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ea52c01e6e13dd8ff409b87299e5586235ef6cea","datavalue":{"value":"10.1016/0167-8191(88)90041-5","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1106010$7327BC55-CE4A-4583-9B44-1DF575856502","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"07373ba2f1ff3118b1a6cd9ece7fee3a17b972b7","datavalue":{"value":{"entity-type":"item","numeric-id":1106008,"id":"Q1106008"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1106010$FAC36044-FB62-447C-967C-9DA2B81DA057","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"585ae3a1d0d5c7bb957e888770c536f56ddcbf6d","datavalue":{"value":{"entity-type":"item","numeric-id":1106009,"id":"Q1106009"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1106010$CA04D114-E5A6-40AA-92B1-0221F6140B7A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"57ee1c66941e9795a2111a971c059f6a282c0034","datavalue":{"value":{"entity-type":"item","numeric-id":208453,"id":"Q208453"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1106010$261E76D6-D2FC-486C-9691-1D2FDA3F20A6","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"eeac13f60c55bdb04ecb49274cc7b24a1688345d","datavalue":{"value":{"entity-type":"item","numeric-id":71527,"id":"Q71527"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1106010$0CD9C6B4-D39E-4D9F-835F-78B1E76B449D","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":"Q1106010$193C0899-33F6-44E0-88BD-14AA0158C1D1","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"1df00552f7dd3d2500d1c35eebd01d1f09eb4d93","datavalue":{"value":"The problem of multiprocessor scheduling is discussed with special regard to the Hughes data-flow multiprocessor. Several partitioning and allocation mechanisms are presented and analyzed, including simulation experiments.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1106010$C81605FE-D755-4E75-932B-93443B7270FD","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"517ace4a4f9c45a5475b4a8927a567447dbdb293","datavalue":{"value":"68N99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1106010$59112EEF-DCF9-4061-BE2A-50447B65D8DF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8a7edc01538ef78e7e423d9c49f622de0faa5a14","datavalue":{"value":"65Y05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1106010$5E2372D3-6FBB-48EB-9FFA-CE4F71A71F8C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1908801a2431998085c7d582418a428f7e7f6658","datavalue":{"value":"68M20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1106010$C5AFB7F6-2B8E-4E2D-905E-0DB1A4516124","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ec3769495799f08479987ac368adf64f125a2b66","datavalue":{"value":"68N25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1106010$3C53F7C6-1DF0-4745-BBB4-D2D1698D19B8","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c77dc29bc1dd9fafbe080c0de3710edadb2b67b9","datavalue":{"value":"4060681","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1106010$4745AB9C-28AD-447F-803A-331026E75135","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2484ef43bc9c784b4200ae297f0d99c551e12110","datavalue":{"value":"multiprocessor scheduling","type":"string"},"datatype":"string"},"type":"statement","id":"Q1106010$2FE23357-1F65-43FA-983E-3FE27B8E9C54","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"dc6ead4337be84065ddc50910b7d4f8cb0348495","datavalue":{"value":"Hughes data-flow multiprocessor","type":"string"},"datatype":"string"},"type":"statement","id":"Q1106010$52DE9024-D819-47AF-8BCA-BA3D3EA6DE80","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ee4333081aeed9cb416827114fc33bcfc3b51deb","datavalue":{"value":"partitioning","type":"string"},"datatype":"string"},"type":"statement","id":"Q1106010$959A2039-05B4-4C4F-82B1-79A449B87722","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ba302d31e19bb33e51ec7357f68f4add047b8560","datavalue":{"value":"allocation","type":"string"},"datatype":"string"},"type":"statement","id":"Q1106010$641990C4-1954-45B8-B844-D1DBE33E63DE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"46491cc0cbf1240a5b9decf581dd6d551a592638","datavalue":{"value":"simulation experiments","type":"string"},"datatype":"string"},"type":"statement","id":"Q1106010$79C09BFB-35A8-42CC-A527-6A5E4AECCA8D","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":"Q1106010$4CBFBE7F-6847-43A2-86D1-0D42FC160B5F","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"e31ea3b8ec6cb60e7b3c3c8ab93b22955ddb8eb8","datavalue":{"value":"https://doi.org/10.1016/0167-8191(88)90041-5","type":"string"},"datatype":"url"},"type":"statement","id":"Q1106010$82B203BC-41B0-4ECA-B7FF-5D8975EBD543","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"b9733befdc774eff03f559b455bfa064137bc600","datavalue":{"value":"W1988608115","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1106010$26B1D5DC-0755-4B8F-A401-98E489529FA5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Program graph allocation in distributed multicomputers","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Program_graph_allocation_in_distributed_multicomputers"}}}}}