{"id":"https://openalex.org/W2551920655","doi":null,"title":"Task dispatching in shared memory multiple processor systems","display_name":"Task dispatching in shared memory multiple processor systems","publication_year":1996,"publication_date":"1996-10-03","ids":{"openalex":"https://openalex.org/W2551920655","mag":"2551920655"},"language":"en","primary_location":{"id":"mag:2551920655","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=239911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5001488963","display_name":"Esther A. Hughes","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"E.A. Hughes","raw_affiliation_strings":["cornell University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"cornell University","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001488963"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9320999979972839,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9320999979972839,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.05420000106096268,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.006000000052154064,"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/task-dispatching","display_name":"task dispatching","score":0.9980000257492065},{"id":"https://openalex.org/keywords/shared-memory-multiprocessors","display_name":"shared-memory multiprocessors","score":0.9900000095367432},{"id":"https://openalex.org/keywords/scheduling-overhead","display_name":"scheduling overhead","score":0.7009999752044678},{"id":"https://openalex.org/keywords/specialized-processors","display_name":"special-purpose processors","score":0.6710000038146973},{"id":"https://openalex.org/keywords/round-robin","display_name":"round robin","score":0.621999979019165},{"id":"https://openalex.org/keywords/random-sampling","display_name":"random sampling","score":0.7940000295639038},{"id":"https://openalex.org/keywords/interconnection-networks","display_name":"interconnection networks","score":0.6660000085830688}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7958709001541138},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.749433159828186},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7015678882598877},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6402269601821899},{"id":"https://openalex.org/C201511382","wikidata":"https://www.wikidata.org/wiki/Q16801758","display_name":"Multilevel queue","level":4,"score":0.5542697310447693},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.544962465763092},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5226571559906006},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5070195198059082},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.4468197524547577},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.43392688035964966},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41917678713798523},{"id":"https://openalex.org/C128220111","wikidata":"https://www.wikidata.org/wiki/Q4531011","display_name":"Queue management system","level":3,"score":0.35798126459121704},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.21489083766937256},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21402251720428467},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2551920655","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=239911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1989336110","https://openalex.org/W4241802968","https://openalex.org/W4236240388","https://openalex.org/W2111572046","https://openalex.org/W146452893","https://openalex.org/W2143865049","https://openalex.org/W2242577560","https://openalex.org/W137473724","https://openalex.org/W2189388087","https://openalex.org/W7100553777"],"abstract_inverted_index":{"The":[0,257],"efficient":[1],"use":[2],"of":[3,40,93,116,140,156,165,176],"processors":[4,57,71,172],"in":[5,81,248,274],"a":[6,17,21,29,51,77,91,151,157,224,276],"shared":[7,18,52,78,336],"memory":[8,19,53,304,321,337],"multiprocessor":[9,54,338],"is":[10,100,114,189,306],"essential":[11],"to":[12,26,60,76,83],"high":[13],"system":[14,98,227],"performance.":[15],"In":[16,36],"multiprocessor,":[20],"bottleneck":[22,44],"can":[23,173,325],"form":[24],"due":[25],"contention":[27],"for":[28,73,191,208,223,330,335],"single":[30,158,186,209],"task":[31,48,79,87,107,122,125,142,153,168,187,192,212,230,234,243,281,285,332],"queue":[32,80,154,159,188,215,244,265],"containing":[33,170,182],"executable":[34],"tasks.":[35],"this":[37,42],"thesis,":[38],"methods":[39],"reducing":[41,94],"inherent":[43],"are":[45,145,246,268,311],"addressed":[46],"via":[47,66],"dispatching":[49,88,108,143,193,333],"techniques.\r\nIn":[50],"system,":[55],"N":[56],"have":[58],"access":[59,75,305,322],"the":[61,141,166,198,280,283,294,299],"same":[62],"logical":[63],"address":[64],"space":[65],"an":[67,120,131],"interconnection":[68,132],"mechanism;":[69],"idle":[70],"compete":[72],"sole":[74],"order":[82],"obtain":[84],"work.\r\nWe":[85],"examine":[86],"policies":[89,238,251,267],"as":[90,328],"method":[92],"scheduling":[95],"overhead.":[96],"A":[97,185,217,270],"model":[99,113],"developed":[101],"that":[102],"encompasses":[103],"current":[104],"and":[105,110,127,134,210,232,261,287,308],"potential":[106],"structures":[109],"policies.":[111],"This":[112,206],"composed":[115,155],"three":[117],"staging":[118],"buffers:":[119],"input":[121],"buffer,":[123,282],"central":[124,152,167,284],"queue,":[126,286,291],"local":[128,290],"processor":[129,277],"queues;":[130],"network;":[133],"processors.\r\nThree":[135],"issues":[136],"involving":[137,239],"basic":[138],"aspects":[139],"problem":[144],"addressed:":[146],"specialized":[147,171],"versus":[148,160],"nonspecialized":[149,183],"processors;":[150],"multiple":[161,201,211,229,233,240],"subqueues;":[162],"physical":[163],"location":[164],"queue.\r\nSystems":[169],"perform":[174],"upwards":[175],"1000":[177],"times":[178],"worse":[179],"than":[180],"those":[181],"processors.":[184],"adequate":[190],"under":[194,319],"light":[195],"loads.":[196],"As":[197],"load":[199],"increases,":[200],"subqueues":[202],"become":[203],"more":[204],"beneficial.":[205],"holds":[207],"removal":[213],"per":[214,236,242],"access.":[216],"79.5%":[218],"performance":[219,301],"increase":[220],"was":[221],"achieved":[222],"moderately":[225],"loaded":[226],"assuming":[228],"queues":[231],"removals":[235],"access.\r\nSelection":[237],"accesses":[241],"visit":[245],"examined":[247],"tandem":[249],"with":[250,253,293],"concerned":[252],"stage":[254],"visitation":[255],"order.":[256],"round":[258,263],"robin,":[259],"random,":[260],"random":[262,295],"robin":[264],"selection":[266,296,316],"studied.":[269],"scheme":[271],"(scheme":[272],"C)":[273],"which":[275],"first":[278],"visits":[279],"finally":[288],"its":[289],"along":[292],"policy":[297,317],"offers":[298],"best":[300],"when":[302],"uniform":[303],"assumed,":[307],"excess":[309],"tasks":[310],"not":[312],"enqueued":[313],"locally.":[314],"Neither":[315],"excels":[318],"nonuniform":[320],"conditions.\r\nOur":[323],"findings":[324],"be":[326],"used":[327],"guidelines":[329],"designing":[331],"schemes":[334],"systems.":[339]},"counts_by_year":[],"updated_date":"2026-09-22T06:50:58.402377","created_date":"2016-11-30T00:00:00"}