{"id":4311,"identifier":"FK2/1DGUVE","persistentUrl":"https://doi.org/10.60507/FK2/1DGUVE","protocol":"doi","authority":"10.60507","separator":"/","publisher":"bonndata","publicationDate":"2024-03-04","storageIdentifier":"file://10.60507/FK2/1DGUVE","metadataLanguage":"en","datasetType":"dataset","datasetVersion":{"id":215,"datasetId":4311,"datasetPersistentId":"doi:10.60507/FK2/1DGUVE","storageIdentifier":"file://10.60507/FK2/1DGUVE","versionNumber":1,"versionMinorNumber":0,"versionState":"RELEASED","latestVersionPublishingState":"RELEASED","deaccessionLink":"","lastUpdateTime":"2024-03-04T07:54:35Z","releaseTime":"2024-03-04T07:54:35Z","createTime":"2024-02-27T16:26:50Z","publicationDate":"2024-03-04","citationDate":"2024-03-04","license":{"name":"CC0 1.0","uri":"http://creativecommons.org/publicdomain/zero/1.0","iconUri":"https://licensebuttons.net/p/zero/1.0/88x31.png","rightsIdentifier":"CC0-1.0","rightsIdentifierScheme":"SPDX","schemeUri":"https://spdx.org/licenses/","languageCode":"en"},"fileAccessRequest":true,"metadataBlocks":{"citation":{"displayName":"Citation Metadata","name":"citation","fields":[{"typeName":"title","multiple":false,"typeClass":"primitive","value":"Minimum Mean Cycle Instances"},{"typeName":"author","multiple":true,"typeClass":"compound","value":[{"authorName":{"typeName":"authorName","multiple":false,"typeClass":"primitive","value":"Held, Stephan"},"authorAffiliation":{"typeName":"authorAffiliation","multiple":false,"typeClass":"primitive","value":"University of Bonn"},"authorIdentifierScheme":{"typeName":"authorIdentifierScheme","multiple":false,"typeClass":"controlledVocabulary","value":"ORCID"},"authorIdentifier":{"typeName":"authorIdentifier","multiple":false,"typeClass":"primitive","value":"https://orcid.org/0000-0003-2188-1559","expandedvalue":{"personName":"Held, Stephan","@id":"https://orcid.org/0000-0003-2188-1559","scheme":"ORCID","@type":"https://schema.org/Person"}}}]},{"typeName":"datasetContact","multiple":true,"typeClass":"compound","value":[{"datasetContactName":{"typeName":"datasetContactName","multiple":false,"typeClass":"primitive","value":"Held, Stephan"},"datasetContactAffiliation":{"typeName":"datasetContactAffiliation","multiple":false,"typeClass":"primitive","value":"University of Bonn"},"datasetContactEmail":{"typeName":"datasetContactEmail","multiple":false,"typeClass":"primitive","value":"held@dm.uni-bonn.de"}}]},{"typeName":"dsDescription","multiple":true,"typeClass":"compound","value":[{"dsDescriptionValue":{"typeName":"dsDescriptionValue","multiple":false,"typeClass":"primitive","value":"This data set contains some large real-world instances of the minimum mean cycle problem.\nThey are reported as the bonn01 to bonn09 instances in the paper:\n<br>\n<br>\nGeorgiadis, L., Goldberg, A. V., Tarjan, R. E., & Werneck, R. F.\n\"An experimental study of minimum mean cycle algorithms\",\nin 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 1–13,\nSIAM.\n<br>\n<br>\nThe instances arise in  clock skew scheduling in chip design, e.g. see\n<br>\n<br>\nHeld, S., Korte, B., Rautenbach, D. and Vygen, J.\n\"Combinatorial optimization in VLSI design. Combinatorial Optimization\",\nin Combinatorial Optimization, NATO Science for Peace and Security Series - D: Information and Communication Security, pp. 33–96, 2011.\n<br>\n<br>\nThe clock skew scheduling problem in chip design is, given a directed graph G with edge delays d:E(G)-> R,\nfind a minimum cycle time T and arrival times (a schedule) a: V(G) -> R such that\n<br>\n<br>\n  a(v) + d(v,w) <= a(w) + T for all (v,w) in E(G).\n<br>\n<br>\nG is called a latch graph. The nodes represent latches and registers, and the edges represent the longest signal paths between registers.\n<br>\nThe problem of minimizing T is equivalent to maximizing the worst slack min{s(v,w) := a(w) + T - a(v) - d(v,w) | (v,w) in E(G)} for a fixed cycle time T.\n\n<br>\n\nThe instances provided in the tar file below consist of directed graphs with edge costs c(v,w) = T - d(v,w),\ni.e. edge slacks w.r.t. a zero-skew schedule where a = 0.\nThe maximum achievable worst slack by varying the schedule 'a' equals the value of a minimum mean cycle in (G,c).\nInstance sizes range from 70346 nodes and 898220 edges to 1065274 nodes and 104340248 edges.\nOther instances are very dense, e.g. 5361 nodes and 4169878 edges.\n<br>\nNote that the instances may not be strongly connected or even connected.\nFormat: Ignore empty lines and lines starting with '#', then:\n1st line: number_of_nodes number_of_edges\nnext lines: from_node to_node edge_cost (i.e., zero skew slack)"},"dsDescriptionDate":{"typeName":"dsDescriptionDate","multiple":false,"typeClass":"primitive","value":"2024-02-27"}}]},{"typeName":"subject","multiple":true,"typeClass":"controlledVocabulary","value":["Engineering","Mathematical Sciences"]},{"typeName":"subjectRefinement","multiple":true,"typeClass":"compound","value":[{"subjectRefinementValue":{"typeName":"subjectRefinementValue","multiple":false,"typeClass":"primitive","value":"combinatorial optimization"}}]},{"typeName":"freeKeyword","multiple":true,"typeClass":"compound","value":[{"freeKeywordValue":{"typeName":"freeKeywordValue","multiple":false,"typeClass":"primitive","value":"mininum mean-cycle instances"}}]},{"typeName":"publication","multiple":true,"typeClass":"compound","value":[{"publicationCitation":{"typeName":"publicationCitation","multiple":false,"typeClass":"primitive","value":"Georgiadis, L., Goldberg, A. V., Tarjan, R. E., & Werneck, R. F.\n\"An experimental study of minimum mean cycle algorithms\",\nin 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 1-13,\nSIAM."},"publicationIDType":{"typeName":"publicationIDType","multiple":false,"typeClass":"controlledVocabulary","value":"isbn"},"publicationIDNumber":{"typeName":"publicationIDNumber","multiple":false,"typeClass":"primitive","value":"978-0-89871-930-7"},"publicationURL":{"typeName":"publicationURL","multiple":false,"typeClass":"primitive","value":"https://epubs.siam.org/doi/abs/10.1137/1.9781611972894.1"}}]},{"typeName":"depositor","multiple":false,"typeClass":"primitive","value":"Held, Stephan"},{"typeName":"dateOfDeposit","multiple":false,"typeClass":"primitive","value":"2024-02-27"}]},"codeMeta20":{"displayName":"Software Metadata (CodeMeta v2.0)","name":"codeMeta20","fields":[]}},"files":[{"label":"Held_MMC_Readme.txt","restricted":false,"version":2,"datasetVersionId":215,"dataFile":{"id":4314,"persistentId":"doi:10.60507/FK2/1DGUVE/IYUU0X","pidURL":"https://doi.org/10.60507/FK2/1DGUVE/IYUU0X","filename":"Held_MMC_Readme.txt","contentType":"text/plain","friendlyType":"Plain Text","filesize":3854,"storageIdentifier":"file://18df0232287-4b25821bfb40","rootDataFileId":-1,"md5":"cb88362d49622f3677adc43b03cf9f7f","checksum":{"type":"MD5","value":"cb88362d49622f3677adc43b03cf9f7f"},"tabularData":false,"creationDate":"2024-02-28","publicationDate":"2024-03-04","fileAccessRequest":true}},{"label":"cyopt_instances.tar","restricted":false,"version":1,"datasetVersionId":215,"dataFile":{"id":4315,"persistentId":"doi:10.60507/FK2/1DGUVE/GM5JWZ","pidURL":"https://doi.org/10.60507/FK2/1DGUVE/GM5JWZ","filename":"cyopt_instances.tar","contentType":"application/x-tar","friendlyType":"TAR Archive","filesize":673904640,"storageIdentifier":"file://18df023f1b0-70da123b86c3","rootDataFileId":-1,"md5":"204f7799f46c32af563064ea6325a8e2","checksum":{"type":"MD5","value":"204f7799f46c32af563064ea6325a8e2"},"tabularData":false,"creationDate":"2024-02-28","publicationDate":"2024-03-04","fileAccessRequest":true}}],"citation":"Held, Stephan, 2024, \"Minimum Mean Cycle Instances\", https://doi.org/10.60507/FK2/1DGUVE, bonndata, V1"}}