{"id":"https://openalex.org/W2518963049","doi":"https://doi.org/10.1109/hpcsim.2016.7568366","title":"A dynamic run-profile energy-aware approach for scheduling computationally intensive bioinformatics applications","display_name":"A dynamic run-profile energy-aware approach for scheduling computationally intensive bioinformatics applications","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2518963049","doi":"https://doi.org/10.1109/hpcsim.2016.7568366","mag":"2518963049"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2016.7568366","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2016.7568366","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on High Performance Computing & Simulation (HPCS)","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/A5065630154","display_name":"Sachin Pawaskar","orcid":null},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sachin Pawaskar","raw_affiliation_strings":["Department of Computer Science, University of Nebraska at Omaha, Omaha, NE, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nebraska at Omaha, Omaha, NE, USA","institution_ids":["https://openalex.org/I122266389"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047703641","display_name":"Hesham Ali","orcid":"https://orcid.org/0000-0001-6675-7987"},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hesham H. Ali","raw_affiliation_strings":["Department of Computer Science, University of Nebraska at Omaha, Omaha, NE, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nebraska at Omaha, Omaha, NE, USA","institution_ids":["https://openalex.org/I122266389"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065630154"],"corresponding_institution_ids":["https://openalex.org/I122266389"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09432011,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"427","last_page":"434"},"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.9991999864578247,"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.9991999864578247,"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.9983000159263611,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.8043689727783203},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6255638599395752},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5565537214279175},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5324797630310059},{"id":"https://openalex.org/keywords/supercomputer","display_name":"Supercomputer","score":0.44763290882110596},{"id":"https://openalex.org/keywords/energy-minimization","display_name":"Energy minimization","score":0.4298635721206665},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4125726819038391},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.35125240683555603},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.23280751705169678},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18658772110939026},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10982632637023926}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8043689727783203},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6255638599395752},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5565537214279175},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5324797630310059},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.44763290882110596},{"id":"https://openalex.org/C14961307","wikidata":"https://www.wikidata.org/wiki/Q5377176","display_name":"Energy minimization","level":2,"score":0.4298635721206665},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4125726819038391},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.35125240683555603},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.23280751705169678},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18658772110939026},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10982632637023926},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C147597530","wikidata":"https://www.wikidata.org/wiki/Q369472","display_name":"Computational chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcsim.2016.7568366","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2016.7568366","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Responsible consumption and production","id":"https://metadata.un.org/sdg/12","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W170980215","https://openalex.org/W1510543252","https://openalex.org/W1573548168","https://openalex.org/W1985928578","https://openalex.org/W2006244123","https://openalex.org/W2062652009","https://openalex.org/W2156137607","https://openalex.org/W2165275262","https://openalex.org/W2320023897","https://openalex.org/W2734276460","https://openalex.org/W3037385489","https://openalex.org/W3184274845","https://openalex.org/W4231628338","https://openalex.org/W4241729224","https://openalex.org/W4285719527","https://openalex.org/W6630558366","https://openalex.org/W6651933234","https://openalex.org/W7028336821"],"related_works":["https://openalex.org/W2384867379","https://openalex.org/W4400094300","https://openalex.org/W2329539859","https://openalex.org/W2227905990","https://openalex.org/W2765823764","https://openalex.org/W3214280620","https://openalex.org/W3191490922","https://openalex.org/W2794038527","https://openalex.org/W2327638088","https://openalex.org/W2151092287"],"abstract_inverted_index":{"High":[0],"Performance":[1],"Computing":[2],"(HPC)":[3],"resources":[4,146],"are":[5,17,136,141],"housed":[6],"in":[7,26,42,46,69,218,239],"large":[8],"datacenters,":[9],"which":[10,180,194],"consume":[11],"exorbitant":[12],"amounts":[13],"of":[14,156,170,173,192,226],"energy":[15,65,87,200,231,248],"and":[16,52,78,128,233],"quickly":[18],"demanding":[19],"attention":[20],"from":[21],"businesses":[22],"as":[23,50,84,86,202],"they":[24],"result":[25],"high":[27],"operating":[28],"costs.":[29],"On":[30],"the":[31,73,81,100,112,116,125,129,145,153,168,171,182,186,190,198,214,224,236,240,247,252],"other":[32],"hand":[33],"HPC":[34,71],"environments":[35],"have":[36],"been":[37],"very":[38],"useful":[39],"to":[40,110,143,197],"researchers":[41],"many":[43],"emerging":[44],"areas":[45],"life":[47],"sciences":[48],"such":[49],"Bioinformatics":[51],"Medical":[53],"Informatics.":[54],"In":[55,99,115,163],"an":[56,207,244],"earlier":[57],"work,":[58],"we":[59,103,166],"introduced":[60],"a":[61,70,105,119,160],"dynamic":[62],"model":[63,74,96],"for":[64,89,148,185],"aware":[66],"scheduling":[67,131,149],"(EAS)":[68],"environment;":[72],"is":[75,122,181,195],"domain":[76],"agnostic":[77],"incorporates":[79,97],"both":[80],"deadline":[82],"parameter":[83],"well":[85],"parameters":[88],"computationally":[90],"intensive":[91],"applications.":[92],"Our":[93],"proposed":[94,215],"EAS":[95,126,187,253],"2-phases.":[98],"Offline":[101,241],"Phase,":[102],"use":[104],"run":[106,178],"profile":[107,238],"based":[108],"approach":[109,216],"generate":[111],"initial":[113,174],"schedule.":[114],"Online":[117],"Phase":[118],"feedback":[120],"mechanism":[121],"incorporated":[123],"between":[124],"Engine":[127],"master":[130],"process.":[132],"As":[133],"scheduled":[134],"tasks":[135,151],"completed,":[137],"actual":[138],"execution":[139],"times":[140],"used":[142],"adjust":[144],"required":[147],"remaining":[150],"using":[152,176],"least":[154],"number":[155,191,225],"nodes":[157],"while":[158,222],"meeting":[159,219],"given":[161],"deadline.":[162],"this":[164],"paper":[165],"study":[167],"impact":[169,245],"quality":[172],"schedule":[175],"different":[177],"profiles":[179],"starting":[183],"point":[184],"algorithm":[188],"on":[189,246],"adjustments":[193],"critical":[196],"overall":[199,230],"optimization":[201,249],"every":[203],"adjustment":[204],"made":[205],"has":[206,243],"overhead.":[208],"The":[209],"conducted":[210],"experiments":[211],"show":[212],"that":[213,234],"succeeded":[217],"preset":[220],"deadlines":[221],"minimizing":[223],"nodes;":[227],"thus":[228],"reducing":[229],"utilized":[232],"choosing":[235],"right":[237],"phase":[242],"achieved":[250],"by":[251],"algorithm.":[254]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}