{"entities":{"Q578904":{"pageid":580671,"ns":120,"title":"Item:Q578904","lastrevid":62914803,"modified":"2026-04-11T08:58:22Z","type":"item","id":"Q578904","labels":{"en":{"language":"en","value":"A layered method for process and code mapping"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4014018"}},"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":"Q578904$B554EFC9-10E1-42DE-8CF8-E6C9BC68DC02","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"466927f3dd7a3e5b141b7eb332d486979da1ca41","datavalue":{"value":{"text":"A layered method for process and code mapping","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q578904$EBF8970F-6027-48BC-AE96-1940207302BD","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"482dafaf5e7d9f47bc86a6c42e37453507305686","datavalue":{"value":"0624.68031","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q578904$5F538F42-DF65-412C-9E42-72574D71CE2A","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e792eb4da890b25c3a463f6d52ef400f61f97976","datavalue":{"value":"10.1007/BF03037398","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q578904$73EA3CB5-9318-4529-90A8-573FF66C303B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9153f57b49379c8f42a6fee983336120467fb8fa","datavalue":{"value":{"entity-type":"item","numeric-id":551798,"id":"Q551798"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q578904$2FB273DD-F33A-4C44-801D-98CC38924E46","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f3994b3ea7b242f980d845d7f38f3a45e589bc28","datavalue":{"value":{"entity-type":"item","numeric-id":592710,"id":"Q592710"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q578904$3F551FC5-F5CB-4A5D-B14F-2DD9F369A95B","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"1ea61bc9b0eb2c27313173153e64e32651c2ebb5","datavalue":{"value":{"entity-type":"item","numeric-id":169889,"id":"Q169889"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q578904$4188D4BC-8BC4-4CEA-9B0D-1BB5CE44F556","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5ae48c61eed19d1e1e1f33f9255d5b329362d064","datavalue":{"value":{"time":"+1987-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":"Q578904$817DCAAB-EF82-4BF4-8FA5-C998A563BA73","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"015e0a42270608ed22ceadd530768db2027135a2","datavalue":{"value":"The mapping problem has been shown to be computationally equivalent to the graph isomorphism problem; as such it is unlikely that a polynomial time algorithm exists for its solution. Practical algorithms of general applicability and low computational complexity have not been found and are unlikely to appear.    This paper describes a layered method to support specialised process and code mapping strategies. The method separates the task of mapping a problem to a virtual machine from the task of mapping a virtual machine to a physical machine. It allows multiple virtual machines to execute concurrently and many applications to run on a single virtual machine.    The method is in use on a parallel implementation of Flat Concurrent Prolog which runs on an Intel iPSC Hypercube; for concreteness the description is based on this implementation.","type":"string"},"datatype":"string"},"type":"statement","id":"Q578904$C7645A3C-541A-4958-B9E5-79E1B17E41C6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ec3769495799f08479987ac368adf64f125a2b66","datavalue":{"value":"68N25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q578904$F096F373-AE56-4A54-9A8D-A26C3956BDF2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b8e3f40e3cc87753c4e0b7d7ce4bdc00805f626f","datavalue":{"value":"68N01","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q578904$4152F66C-724B-4E01-9CAA-D162A355AE10","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"11b778fd25e5c3553f0fe30701565ffed8175153","datavalue":{"value":"4014018","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q578904$084C96E4-C9EE-4E04-89FF-40BE7E0DF0E6","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1308554ad3460b711fad75984ba405cfa4693683","datavalue":{"value":"concurrent logic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q578904$959B9486-446A-488B-9F78-A04ACBD3650A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"db5e0888fa9957c443e210eb3c88f717e276ae13","datavalue":{"value":"parallel processing","type":"string"},"datatype":"string"},"type":"statement","id":"Q578904$3ADDC158-182A-48D9-807D-3D1A7C82AB14","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2cafb5082163556be2c7213930707cfda3586e4e","datavalue":{"value":"dynamic process mapping","type":"string"},"datatype":"string"},"type":"statement","id":"Q578904$01030E5A-7B7F-4F95-94E0-DB68F08CFE05","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"08d48d333f85ff8767fc20d83e5710b1c647edaf","datavalue":{"value":"shells","type":"string"},"datatype":"string"},"type":"statement","id":"Q578904$D8280034-7509-4B6D-99E6-9008687A4390","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6a89de1d235b98399de6f9817955f395a495bd8c","datavalue":{"value":"virtual machines","type":"string"},"datatype":"string"},"type":"statement","id":"Q578904$69E2C381-8A73-49DA-827E-5F55AA5CCC25","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d4d361d2796450134837299ec93b0affd906c7fb","datavalue":{"value":"parallel implementation of Flat Concurrent Prolog","type":"string"},"datatype":"string"},"type":"statement","id":"Q578904$2C1B06A5-42AB-4FD8-BDD5-147D76F43BD4","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":"Q578904$C3E95363-F507-4875-8C60-AF4B7A5FEF1C","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"f8969d1ded4c03b36f52a3cda33f6a1241f3e9bf","datavalue":{"value":{"entity-type":"item","numeric-id":3727368,"id":"Q3727368"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q578904$557E7CC3-76AD-4295-A9D6-6AE7D31BA0E0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"db40e76eab959d3520b34febdb0b879cf52ca9c0","datavalue":{"value":{"entity-type":"item","numeric-id":1819924,"id":"Q1819924"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q578904$83A8903C-8E70-4D34-8427-B3D0C0E466D5","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0f7f15ea05902b5270c4931f2c202298123be061","datavalue":{"value":{"entity-type":"item","numeric-id":5286031,"id":"Q5286031"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"cc248a4d19b1aaf650d67ba7748c443a66fdd374","datavalue":{"value":{"amount":"+0.7631250023841858","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":"Q578904$A6303D32-6419-411D-AE65-79D9540E6217","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0379df406ed80ef7402e8f65384a31b51b8ff6cb","datavalue":{"value":{"entity-type":"item","numeric-id":4209143,"id":"Q4209143"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"cc248a4d19b1aaf650d67ba7748c443a66fdd374","datavalue":{"value":{"amount":"+0.7631250023841858","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":"Q578904$4DA80614-7C84-4DD8-9AB5-044E7032209F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d6f798d15343af7498ae89693afff6ad119cbd30","datavalue":{"value":{"entity-type":"item","numeric-id":5289224,"id":"Q5289224"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"1b79fe0f659249ff3a275c75cdd201a5cf7ad7c1","datavalue":{"value":{"amount":"+0.762837290763855","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":"Q578904$513C3136-5DA8-4072-A211-FE17A3E2DDE8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"31fa37938489e459dbccd9e284b4a5f41dd3bad4","datavalue":{"value":{"entity-type":"item","numeric-id":2912417,"id":"Q2912417"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"bafa9a0efebabd7dbd98aaeef71d3e0bef300f2e","datavalue":{"value":{"amount":"+0.7445737719535828","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":"Q578904$5F6A4DA3-4457-43BC-A650-63978597C9E5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"cb1f2d00f14dd3b4dd0f239ed85e16ac23cc865e","datavalue":{"value":{"entity-type":"item","numeric-id":3977609,"id":"Q3977609"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"834233969b5848b5f83d20819a4b37e1317132a9","datavalue":{"value":{"amount":"+0.7290254831314087","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":"Q578904$A018D907-1B5C-4FF3-97C1-281CC69D5D51","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A layered method for process and code mapping","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_layered_method_for_process_and_code_mapping"}}}}}