{"doi":"10.1109/74.163806","title":"Large parallel processing revisited: a second tutorial","abstract":null,"journal":"IEEE Antennas and Propagation Magazine","year":1992,"id":27183,"datarank":1.048716203052465,"base_score":2.4849066497880004,"endowment":2.4849066497880004,"self_citation_contribution":0.37273599746820013,"citation_network_contribution":0.675980205584265,"self_endowment_contribution":0.37273599746820013,"citer_contribution":0.675980205584265,"corpus_percentile":null,"corpus_rank":null,"citation_count":11,"citer_count":8,"citers_with_citation_signal":7,"citers_with_endowment":7,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":155466,"name":"D.B. Davidson","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.4849066497880004,"endowment":2.4849066497880004,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"24523987","pmcid":null,"openalex_id":"https://openalex.org/W2162430427","authors":[],"funders":[],"total_grants":0,"fwci":2.7865,"citation_percentile":0.91211818,"influential_citations":0,"citation_trend":[{"year":2017,"count":1}],"oa_status":"closed","license":"https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html","oa_locations":[{"url":"http://xplorestaging.ieee.org/ielx4/74/4249/00163806.pdf?arnumber=163806","host_type":"publisher"},{"url":"https://doi.org/10.1109/74.163806","host_type":"journal"},{"url":"http://hdl.handle.net/10019.1/11093","host_type":"repository"}],"fields_of_study":["Matrix Theory and Algorithms","Electromagnetic Scattering and Analysis","Parallel Computing and Optimization Techniques","Computer Science"],"mesh_terms":[],"keywords":["MIMD","Transputer","Computer science","Parallel computing","Parallel algorithm","Parallel processing","Intel iPSC","Solver","Conjugate gradient method","LU decomposition","Decomposition","Algorithm","Distributed memory","Stability (learning theory)","Matrix decomposition","Computational science","Shared memory"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T16:48:11.340210Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}