{"id":"https://openalex.org/W2079904488","doi":"https://doi.org/10.1145/1851476.1851563","title":"A hybrid Markov chain model for workload on parallel computers","display_name":"A hybrid Markov chain model for workload on parallel computers","publication_year":2010,"publication_date":"2010-06-21","ids":{"openalex":"https://openalex.org/W2079904488","doi":"https://doi.org/10.1145/1851476.1851563","mag":"2079904488"},"language":"en","primary_location":{"id":"doi:10.1145/1851476.1851563","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1851476.1851563","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing","raw_type":"proceedings-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/A5042769382","display_name":"Anne Krampe","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Anne Krampe","raw_affiliation_strings":["TU Dortmund University, Dortmund, Germany","Tu Dortmund University, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"TU Dortmund University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Tu Dortmund University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043701575","display_name":"Joachim Lepping","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Joachim Lepping","raw_affiliation_strings":["TU Dortmund University, Dortmund, Germany","Tu Dortmund University, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"TU Dortmund University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Tu Dortmund University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074193329","display_name":"Wiebke Sieben","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Wiebke Sieben","raw_affiliation_strings":["TU Dortmund University, Dortmund, Germany","Tu Dortmund University, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"TU Dortmund University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Tu Dortmund University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042769382"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":2.4363,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.89393751,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"589","last_page":"596"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.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"}},{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8364803791046143},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.7669800519943237},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6414363980293274},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6399046182632446},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.472973495721817},{"id":"https://openalex.org/keywords/architecture","display_name":"Architecture","score":0.4272424578666687},{"id":"https://openalex.org/keywords/goodness-of-fit","display_name":"Goodness of fit","score":0.42117932438850403},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.38501715660095215},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3480835556983948},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2348051369190216},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2138105034828186}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8364803791046143},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.7669800519943237},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6414363980293274},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6399046182632446},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.472973495721817},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.4272424578666687},{"id":"https://openalex.org/C132480984","wikidata":"https://www.wikidata.org/wiki/Q2034239","display_name":"Goodness of fit","level":2,"score":0.42117932438850403},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38501715660095215},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3480835556983948},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2348051369190216},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2138105034828186},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1851476.1851563","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1851476.1851563","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5299999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1487076132","https://openalex.org/W1497299081","https://openalex.org/W1510274974","https://openalex.org/W1524327605","https://openalex.org/W1525258390","https://openalex.org/W1565502159","https://openalex.org/W1575773008","https://openalex.org/W1583311479","https://openalex.org/W1583510555","https://openalex.org/W1585314083","https://openalex.org/W1820389309","https://openalex.org/W1970675995","https://openalex.org/W1986688654","https://openalex.org/W2008200894","https://openalex.org/W2026648323","https://openalex.org/W2049776775","https://openalex.org/W2061048015","https://openalex.org/W2085826569","https://openalex.org/W2107959373","https://openalex.org/W2271902495","https://openalex.org/W2319041464","https://openalex.org/W2327117606","https://openalex.org/W2801840425","https://openalex.org/W2911354936","https://openalex.org/W7048026136"],"related_works":["https://openalex.org/W2084326697","https://openalex.org/W2027903142","https://openalex.org/W2354322608","https://openalex.org/W2804608325","https://openalex.org/W2077211377","https://openalex.org/W2186675474","https://openalex.org/W2387462590","https://openalex.org/W2056274461","https://openalex.org/W1502379814","https://openalex.org/W2368739446"],"abstract_inverted_index":{"This":[0,23,118],"paper":[1],"proposes":[2],"a":[3,74,113],"comprehensive":[4],"modeling":[5],"architecture":[6],"for":[7,134,138],"workloads":[8],"on":[9,28],"parallel":[10],"computers":[11],"using":[12],"Markov":[13],"chains":[14],"in":[15],"combination":[16],"with":[17,122],"state":[18],"dependent":[19],"empirical":[20],"distribution":[21],"functions.":[22],"hybrid":[24],"approach":[25,119],"is":[26,120],"based":[27],"the":[29,34,37,66,71,77,88,98,106,110,136],"requirements":[30],"of":[31,45,73,81,100,112],"scheduling":[32,115,125],"algorithms:":[33],"model":[35,58,76,89,107],"considers":[36,61],"four":[38],"essential":[39],"job":[40],"attributes":[41],"submission":[42],"time,":[43,50],"number":[44],"required":[46],"processors,":[47],"estimated":[48],"processing":[49,53],"and":[51,84,103],"actual":[52],"time.":[54,68],"So":[55],"far,":[56],"no":[57],"exists":[59],"that":[60],"all":[62],"those":[63],"attributed":[64],"at":[65],"same":[67],"To":[69,127],"assess":[70],"goodness-of-fit":[72,137],"workload":[75,139],"similarity":[78],"between":[79],"sequences":[80],"real":[82],"jobs":[83,85],"generated":[86],"from":[87],"needs":[90],"to":[91,96,104],"be":[92],"captured.":[93],"We":[94],"propose":[95],"reduce":[97],"complexity":[99],"this":[101,129],"task":[102],"evaluate":[105],"by":[108],"comparing":[109],"results":[111],"widely-used":[114],"algorithm":[116],"instead.":[117],"demonstrated":[121],"commonly":[123],"used":[124],"objectives.":[126],"verify":[128],"evaluation":[130],"technique,":[131],"standard":[132],"criteria":[133],"assessing":[135],"models":[140],"are":[141],"additionally":[142],"applied.":[143]},"counts_by_year":[{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}