{"id":"https://openalex.org/W2034180113","doi":"https://doi.org/10.1007/bf02577871","title":"Parallel-access memory management using fast-fits","display_name":"Parallel-access memory management using fast-fits","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W2034180113","doi":"https://doi.org/10.1007/bf02577871","mag":"2034180113"},"language":"en","primary_location":{"id":"doi:10.1007/bf02577871","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02577871","pdf_url":null,"source":{"id":"https://openalex.org/S148521650","display_name":"International Journal of Parallel Programming","issn_l":"0885-7458","issn":["0885-7458","1573-7640"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103350641","display_name":"Theodore Johnson","orcid":null},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Theodore Johnson","raw_affiliation_strings":["Department of Computer and Information Science, University of Florida, 32611-2024, Gainesville, Florida","Department of Computer and Information Science, University of Florida, Gainesville,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, University of Florida, 32611-2024, Gainesville, Florida","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"Department of Computer and Information Science, University of Florida, Gainesville,","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103350641"],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1978125,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"6","first_page":"617","last_page":"644"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8946254849433899},{"id":"https://openalex.org/keywords/allocator","display_name":"Allocator","score":0.7553048729896545},{"id":"https://openalex.org/keywords/uniform-memory-access","display_name":"Uniform memory access","score":0.665120005607605},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6574870944023132},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.6012750864028931},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.593831479549408},{"id":"https://openalex.org/keywords/address-space","display_name":"Address space","score":0.5706762075424194},{"id":"https://openalex.org/keywords/interleaved-memory","display_name":"Interleaved memory","score":0.5597502589225769},{"id":"https://openalex.org/keywords/memory-map","display_name":"Memory map","score":0.48981234431266785},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.43836510181427},{"id":"https://openalex.org/keywords/false-sharing","display_name":"False sharing","score":0.42860519886016846},{"id":"https://openalex.org/keywords/non-uniform-memory-access","display_name":"Non-uniform memory access","score":0.42760607600212097},{"id":"https://openalex.org/keywords/physical-address","display_name":"Physical address","score":0.4197232127189636},{"id":"https://openalex.org/keywords/distributed-shared-memory","display_name":"Distributed shared memory","score":0.41805920004844666},{"id":"https://openalex.org/keywords/flat-memory-model","display_name":"Flat memory model","score":0.4159403443336487},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.4158731698989868},{"id":"https://openalex.org/keywords/data-access","display_name":"Data access","score":0.41581663489341736},{"id":"https://openalex.org/keywords/linked-list","display_name":"Linked list","score":0.4152619242668152},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.3969668745994568},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.3604459762573242},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.3063843846321106},{"id":"https://openalex.org/keywords/semiconductor-memory","display_name":"Semiconductor memory","score":0.20120403170585632},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18797755241394043},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.17564287781715393},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.11948266625404358}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8946254849433899},{"id":"https://openalex.org/C162262903","wikidata":"https://www.wikidata.org/wiki/Q343527","display_name":"Allocator","level":2,"score":0.7553048729896545},{"id":"https://openalex.org/C51290061","wikidata":"https://www.wikidata.org/wiki/Q1936765","display_name":"Uniform memory access","level":4,"score":0.665120005607605},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6574870944023132},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.6012750864028931},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.593831479549408},{"id":"https://openalex.org/C144240696","wikidata":"https://www.wikidata.org/wiki/Q367204","display_name":"Address space","level":2,"score":0.5706762075424194},{"id":"https://openalex.org/C63511323","wikidata":"https://www.wikidata.org/wiki/Q908936","display_name":"Interleaved memory","level":4,"score":0.5597502589225769},{"id":"https://openalex.org/C74426580","wikidata":"https://www.wikidata.org/wiki/Q719484","display_name":"Memory map","level":3,"score":0.48981234431266785},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.43836510181427},{"id":"https://openalex.org/C5165142","wikidata":"https://www.wikidata.org/wiki/Q5432732","display_name":"False sharing","level":5,"score":0.42860519886016846},{"id":"https://openalex.org/C133371097","wikidata":"https://www.wikidata.org/wiki/Q868014","display_name":"Non-uniform memory access","level":5,"score":0.42760607600212097},{"id":"https://openalex.org/C41036726","wikidata":"https://www.wikidata.org/wiki/Q844824","display_name":"Physical address","level":3,"score":0.4197232127189636},{"id":"https://openalex.org/C39528615","wikidata":"https://www.wikidata.org/wiki/Q1229610","display_name":"Distributed shared memory","level":5,"score":0.41805920004844666},{"id":"https://openalex.org/C57863822","wikidata":"https://www.wikidata.org/wiki/Q905488","display_name":"Flat memory model","level":4,"score":0.4159403443336487},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.4158731698989868},{"id":"https://openalex.org/C47487241","wikidata":"https://www.wikidata.org/wiki/Q5227230","display_name":"Data access","level":2,"score":0.41581663489341736},{"id":"https://openalex.org/C146101286","wikidata":"https://www.wikidata.org/wiki/Q7003418","display_name":"Linked list","level":2,"score":0.4152619242668152},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.3969668745994568},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.3604459762573242},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.3063843846321106},{"id":"https://openalex.org/C98986596","wikidata":"https://www.wikidata.org/wiki/Q1143031","display_name":"Semiconductor memory","level":2,"score":0.20120403170585632},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18797755241394043},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.17564287781715393},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.11948266625404358}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02577871","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02577871","pdf_url":null,"source":{"id":"https://openalex.org/S148521650","display_name":"International Journal of Parallel Programming","issn_l":"0885-7458","issn":["0885-7458","1573-7640"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W25540566","https://openalex.org/W114707664","https://openalex.org/W1545155892","https://openalex.org/W1556406165","https://openalex.org/W1965699975","https://openalex.org/W1970854199","https://openalex.org/W1971289999","https://openalex.org/W1980806195","https://openalex.org/W1984921897","https://openalex.org/W1989218322","https://openalex.org/W1996292746","https://openalex.org/W2002257715","https://openalex.org/W2007476635","https://openalex.org/W2036122593","https://openalex.org/W2047434043","https://openalex.org/W2052602889","https://openalex.org/W2057773789","https://openalex.org/W2058805757","https://openalex.org/W2061511578","https://openalex.org/W2062667054","https://openalex.org/W2069278684","https://openalex.org/W2101939036","https://openalex.org/W2103913570","https://openalex.org/W2106627057","https://openalex.org/W2133883933","https://openalex.org/W2147542748","https://openalex.org/W2150603771","https://openalex.org/W2156636942","https://openalex.org/W2158493355","https://openalex.org/W2249508874","https://openalex.org/W2336679799","https://openalex.org/W2752853835","https://openalex.org/W4237467202","https://openalex.org/W6604070528"],"related_works":["https://openalex.org/W4243164802","https://openalex.org/W1976166844","https://openalex.org/W2501039532","https://openalex.org/W2383233881","https://openalex.org/W2381395788","https://openalex.org/W4381611581","https://openalex.org/W3015096516","https://openalex.org/W2083276427","https://openalex.org/W3001658974","https://openalex.org/W2034180113"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}