{"doi":"10.1142/s0129626492000404","title":"A MODEL OF SPECULATIVE PARALLELISM","abstract":"<jats:p> Speculative parallelism is the parallelism that one finds when parallel tasks are spawned in the hope that they will later be of use. While this aggressive form of parallelism promises high levels of parallelism, there are numerous problems involved. In this letter, we propose a model of handling speculative parallelism in Lisp. Some properties of the model, related issues in parallelism and implementation considerations are also discussed. The model described is already incorporated into BaLinda Lisp and the techniques used in its simulation were first used in writing the prototype interpreter on an IBM PC. </jats:p>","journal":"Parallel Processing Letters","year":1992,"id":27248,"datarank":0.37054390438711005,"base_score":1.6094379124341003,"endowment":1.6094379124341003,"self_citation_contribution":0.24141568686511508,"citation_network_contribution":0.12912821752199496,"self_endowment_contribution":0.24141568686511508,"citer_contribution":0.12912821752199496,"corpus_percentile":null,"corpus_rank":null,"citation_count":4,"citer_count":3,"citers_with_citation_signal":3,"citers_with_endowment":3,"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":155686,"name":"C. K. YUEN","orcid":null,"position":1,"is_corresponding":false},{"id":155685,"name":"W. F. WONG","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":1.6094379124341003,"endowment":1.6094379124341003,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"18998881","pmcid":null,"openalex_id":"https://openalex.org/W2105992728","authors":[],"funders":[],"total_grants":0,"fwci":0.3712,"citation_percentile":0.66442738,"influential_citations":0,"citation_trend":[],"oa_status":"closed","license":null,"oa_locations":[{"url":"https://www.worldscientific.com/doi/pdf/10.1142/S0129626492000404","host_type":"publisher"},{"url":"https://doi.org/10.1142/s0129626492000404","host_type":"journal"}],"fields_of_study":["Parallel Computing and Optimization Techniques","Computer Science"],"mesh_terms":[],"keywords":["Lisp","Parallelism (grammar)","Computer science","Instruction-level parallelism","Implicit parallelism","Data parallelism","Task parallelism","Parallel computing","IBM","Speculative multithreading","Interpreter","Programming language","Multithreading","Thread (computing)"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Reduced inequalities"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T17:05:37.952306Z","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":[]}