{"id":"https://openalex.org/W2153889495","doi":"https://doi.org/10.1109/grid.2008.4662819","title":"Investigation of the DAG eligible jobs maximization algorithm in a grid","display_name":"Investigation of the DAG eligible jobs maximization algorithm in a grid","publication_year":2008,"publication_date":"2008-09-01","ids":{"openalex":"https://openalex.org/W2153889495","doi":"https://doi.org/10.1109/grid.2008.4662819","mag":"2153889495"},"language":"en","primary_location":{"id":"doi:10.1109/grid.2008.4662819","is_oa":false,"landing_page_url":"https://doi.org/10.1109/grid.2008.4662819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 9th IEEE/ACM International Conference on Grid 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/A5108088869","display_name":"Tomasz Szepieniec","orcid":null},"institutions":[{"id":"https://openalex.org/I4210149723","display_name":"Krakow Cardiovascular Research Institute","ror":"https://ror.org/05c3cgy93","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210149723"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Tomasz Szepieniec","raw_affiliation_strings":["Academic Computer Centre, Krakow, Poland"],"affiliations":[{"raw_affiliation_string":"Academic Computer Centre, Krakow, Poland","institution_ids":["https://openalex.org/I4210149723"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004326594","display_name":"Marian Bubak","orcid":"https://orcid.org/0000-0001-6083-0549"},"institutions":[{"id":"https://openalex.org/I686019","display_name":"AGH University of Krakow","ror":"https://ror.org/00bas1c41","country_code":"PL","type":"education","lineage":["https://openalex.org/I686019"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marian Bubak","raw_affiliation_strings":["Institute of Computer Science AGH, Krakow, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science AGH, Krakow, Poland","institution_ids":["https://openalex.org/I686019","https://openalex.org/I4210087266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108088869"],"corresponding_institution_ids":["https://openalex.org/I4210149723"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.17865082,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2790","issue":null,"first_page":"340","last_page":"345"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":1.0,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":1.0,"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.9959999918937683,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9829999804496765,"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.8086968660354614},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.646926760673523},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6282514929771423},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5784523487091064},{"id":"https://openalex.org/keywords/grid-computing","display_name":"Grid computing","score":0.553022563457489},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"Utility maximization","score":0.5271605849266052},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5259485244750977},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5254831910133362},{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.5253759622573853},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3093610405921936},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24736353754997253},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09260478615760803},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.08603978157043457}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8086968660354614},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.646926760673523},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6282514929771423},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5784523487091064},{"id":"https://openalex.org/C70429105","wikidata":"https://www.wikidata.org/wiki/Q249999","display_name":"Grid computing","level":3,"score":0.553022563457489},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.5271605849266052},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5259485244750977},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5254831910133362},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.5253759622573853},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3093610405921936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24736353754997253},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09260478615760803},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.08603978157043457},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/grid.2008.4662819","is_oa":false,"landing_page_url":"https://doi.org/10.1109/grid.2008.4662819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 9th IEEE/ACM International Conference on Grid Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/20c87bc4-bc15-45f2-b7e1-0faf22bd76f2","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/investigation-of-the-dag-eligible-jobs-maximization-algorithm-in-a-grid(20c87bc4-bc15-45f2-b7e1-0faf22bd76f2).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Szepieniec, T & Bubak, M 2008, Investigation of the DAG eligible jobs maximization algorithm in a grid. in Grid 2008: proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing: September 29th-October 1st, 2008, Tsukuba, Japan. Piscataway, N.J., pp. 340-345, 9th IEEE/ACM International Conference on Grid Computing (Grid 2008), 29/09/08. https://doi.org/10.1109/GRID.2008.4662819","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:publications/20c87bc4-bc15-45f2-b7e1-0faf22bd76f2","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/investigation-of-the-dag-eligible-jobs-maximization-algorithm-in-a-grid(20c87bc4-bc15-45f2-b7e1-0faf22bd76f2).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Szepieniec, T & Bubak, M 2008, Investigation of the DAG eligible jobs maximization algorithm in a grid. in Grid 2008: proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing: September 29th-October 1st, 2008, Tsukuba, Japan. Piscataway, N.J., pp. 340-345, 9th IEEE/ACM International Conference on Grid Computing (Grid 2008), 29/09/08. https://doi.org/10.1109/GRID.2008.4662819","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W145079279","https://openalex.org/W1508297467","https://openalex.org/W1606543899","https://openalex.org/W1982602839","https://openalex.org/W2098052035","https://openalex.org/W2100550451","https://openalex.org/W2103590782","https://openalex.org/W2106807934","https://openalex.org/W2117585240","https://openalex.org/W2128709423","https://openalex.org/W2136405540","https://openalex.org/W2137717294","https://openalex.org/W2149294210","https://openalex.org/W2151537101","https://openalex.org/W2171985647","https://openalex.org/W6605909010","https://openalex.org/W6630438185","https://openalex.org/W6677365402","https://openalex.org/W6682312617"],"related_works":["https://openalex.org/W3121521771","https://openalex.org/W30823005","https://openalex.org/W2393902186","https://openalex.org/W4388998647","https://openalex.org/W2267645079","https://openalex.org/W2741533395","https://openalex.org/W4296628518","https://openalex.org/W4380149910","https://openalex.org/W2490250203","https://openalex.org/W2118922860"],"abstract_inverted_index":{"A":[0],"significant":[1],"influence":[2],"of":[3,7,12,23,42,46,60],"heterogeneity":[4],"and":[5,30],"uncertainty":[6],"grid":[8],"environment":[9,53],"on":[10],"quality":[11],"DAG":[13,34],"schedules":[14],"results":[15,41],"in":[16,50,54],"a":[17,43,51],"search":[18],"for":[19,33],"new":[20],"approaches.":[21],"One":[22],"them":[24],"is":[25],"Internet-based":[26],"computing":[27],"scheduling":[28],"approach":[29],"PRIO":[31,48],"algorithm":[32],"scheduling.":[35],"In":[36],"this":[37],"paper,":[38],"we":[39],"present":[40],"detailed":[44],"evaluation":[45],"the":[47],"algorithms":[49],"heterogeneous":[52],"which":[55],"schedulers":[56],"may":[57],"recognize":[58],"performance":[59],"resources.":[61]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-16T09:10:04.655348","created_date":"2025-10-10T00:00:00"}