{"entities":{"Q1086977":{"pageid":1097729,"ns":120,"title":"Item:Q1086977","lastrevid":69607806,"modified":"2026-04-13T08:10:17Z","type":"item","id":"Q1086977","labels":{"en":{"language":"en","value":"Computational models and task scheduling for parallel sparse Cholesky factorization"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3986520"}},"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":"Q1086977$EB4696A0-CBBD-42C9-B263-F2EC6E76768E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0e40d094004ed15d559e32ece521a097cbb696b4","datavalue":{"value":{"text":"Computational models and task scheduling for parallel sparse Cholesky factorization","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1086977$B0B705E3-F56D-453A-9FAD-7DDA98D96A98","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"e710388aee6bc17998839a82dcfb807b22b41a7d","datavalue":{"value":"0609.65014","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1086977$C75D7AFD-8743-49B8-ADFA-D2D5B25EA560","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"d6278a871199229e3dadf70da2cf2d0f599cb778","datavalue":{"value":"10.1016/0167-8191(86)90014-1","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1086977$05DE0721-BEB4-4CC8-A0F1-76CBC43817B0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"1f153417668b9a5c5d367a1f1668e47f50cfb609","datavalue":{"value":{"entity-type":"item","numeric-id":871146,"id":"Q871146"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1086977$AFE8B822-E496-445F-83BA-9A6CD2BA7DA0","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":"Q1086977$48FEBAE3-4C28-41C8-A0CF-0EE932BE3B13","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":"Q1086977$B7A33D87-26A1-475D-B363-907C0DFF3204","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"948e5c7a522a55eb5aa91d07f5e605774b9ff2ba","datavalue":{"value":"The numerical solution of linear systems has the following typical phases: ordering, symbolic factorization, numeric factorization, and numeric substitution. In this paper the numeric factorization phase for parallel computation is studied. A parallel sparse Cholesky factorization algorithm is formulated. It is suitable for parallel machines with shared-memory architecture, like Denelcor HEP. The algorithm is based on the medium-grained graph model of column-oriented tasks and a critical path type of scheduling. A variant of the scheme allowing preemption is also described. The algorithm assumes that the given matrix has already been ordered by some fill-reducing ordering algorithm, e.g. the minimum degree ordering.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1086977$71573F75-07F6-4C0F-93B2-46A9C580E297","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9885aef811aa349f50c28b046ac04fbe99524c67","datavalue":{"value":"65F05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1086977$90413048-5A1F-4F32-B685-E9FDBB882A32","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"bb68a4ead97a966e0738a004317f6777af7ecfa4","datavalue":{"value":"65F50","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1086977$EE3AA700-555A-4126-A639-B922BCD7402D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a1973d0f6fbfa80907e23b6535325b41148d87ed","datavalue":{"value":"3986520","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1086977$BB6AD40A-3D00-4F13-BC3C-A61D05DE54E3","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"100c12eba5f594c72fb4625335cbe73f55884568","datavalue":{"value":"numeric factorization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1086977$F4F435CB-E997-4A83-9690-1BF7B56D2268","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"efa6630f6f7c44fd6767d6cb5d4bad73c59aa3ad","datavalue":{"value":"parallel sparse Cholesky factorization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1086977$445CB31E-14D5-4180-AF2D-1DEF1F4F3CDD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"40ab6f20a16d00402c6c654d8708d65ebb67e6f3","datavalue":{"value":"medium- grained graph model","type":"string"},"datatype":"string"},"type":"statement","id":"Q1086977$DE42817D-80F2-46C7-968A-61F8C8B70980","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0605a1f2800486f9350885e9d3e822d311d76006","datavalue":{"value":"scheduling","type":"string"},"datatype":"string"},"type":"statement","id":"Q1086977$8E1698B7-DE38-415A-96F5-8241EB332CED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3df6bd86331c4f112a52d4d647b9c484dff9a0b9","datavalue":{"value":"fill-reducing ordering","type":"string"},"datatype":"string"},"type":"statement","id":"Q1086977$06756CBF-53C0-42E1-9A69-72E52F8C4FBE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a0934d596ead81ed0f19a3da8ea6044f1959b7fd","datavalue":{"value":"minimum degree ordering","type":"string"},"datatype":"string"},"type":"statement","id":"Q1086977$1C250CE8-94D0-48D2-9EDF-8CE8AAFE753B","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":"Q1086977$1C42BCA6-A93C-41FB-943E-0224F6F0EE5C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"b167d8b439e4e2df9b8f67b4a4c89688a75a3316","datavalue":{"value":"https://doi.org/10.1016/0167-8191(86)90014-1","type":"string"},"datatype":"url"},"type":"statement","id":"Q1086977$DA96CBF2-0012-463D-94F5-5801448B4484","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"6853def5e6e7d43da9c3e5820fe248752ea40186","datavalue":{"value":"W1980946208","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1086977$527C9F28-9D3C-4A68-8DB0-65F856184F79","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ae5e0b6513a3c6f999622e08436bebdb8f1a8e56","datavalue":{"value":{"entity-type":"item","numeric-id":915427,"id":"Q915427"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e1e6580a48ffd46f4c9ac0bfd90fea4e0c7d6325","datavalue":{"value":{"amount":"+0.8712084889411926","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":"Q1086977$BF08D6E8-2728-413C-A81E-4C76BAA9C8C8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6601c0496c5e7e62d9a5ee1fbc6461ec5b83f84f","datavalue":{"value":{"entity-type":"item","numeric-id":1201013,"id":"Q1201013"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"cd5e63d8a4fc1ce1a382befbba0e66207385a0bd","datavalue":{"value":{"amount":"+0.8572158217430115","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":"Q1086977$FFA075BE-F042-44B0-9776-3C447681FB72","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"145846469931c378cd9365fd9b25ffb4560615e7","datavalue":{"value":{"entity-type":"item","numeric-id":3981404,"id":"Q3981404"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3a175dd54af0756dfe339006281cde0a0d762307","datavalue":{"value":{"amount":"+0.8567620515823364","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":"Q1086977$1C950B10-BCB3-46F0-B532-AFBC2D3D7892","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5cd5c4808f4bd326f08a707383c0bfc2d30a184b","datavalue":{"value":{"entity-type":"item","numeric-id":4860184,"id":"Q4860184"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"dde007270db17272053ceae7248dbcf92cb616fc","datavalue":{"value":{"amount":"+0.8555722236633301","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":"Q1086977$5DCB61F3-7CD9-4523-8FC0-8BB4E8A0D634","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"4d37af17385afff0eccd32db186581343e55c97a","datavalue":{"value":{"entity-type":"item","numeric-id":4537015,"id":"Q4537015"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"961568ed4418401ad2b2525bee6aebb8c4d752e1","datavalue":{"value":{"amount":"+0.8534256815910339","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":"Q1086977$90B2AECB-753E-40FF-809C-E4168B3A865A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Computational models and task scheduling for parallel sparse Cholesky factorization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Computational_models_and_task_scheduling_for_parallel_sparse_Cholesky_factorization"}}}}}