{"title":"Algorithms for Random Adjacency Matrixes Generation Used for Scheduling Algorithms Test","authors":"Yingfeng Wang, Zhijing Liu, Wei Yan","doi":"10.1109/MVHI.2010.190","DOIUrl":null,"url":null,"abstract":"In order to meet the testing requirements of task scheduling algorithms, this paper proposes two algorithms for generating random adjacency matrixes. One algorithm is used for generating random adjacency matrixes representing either directed cyclic graphs or directed acyclic graphs. The other algorithm is used for generating directed acyclic graphs only. The paper analyses the characters of elements of an adjacency matrix, and applies a square matrix with elements falling into a Gaussian distribution and the technique of descending order to achieve a random adjacency matrix. We conduct experiments on our algorithms using MATLAB. The experimental results show that the algorithms have high efficiencies, and adjacency matrixes which represent task graphs with dozens of nodes and dozens of edges can be generated in one minute. Those random adjacency matrixes generated by the algorithms are suited for task scheduling algorithms which use random adjacency matrixes to verify validities.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"HumanMachine Communication Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MVHI.2010.190","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Social Sciences","Score":null,"Total":0}
引用次数: 14
Abstract
In order to meet the testing requirements of task scheduling algorithms, this paper proposes two algorithms for generating random adjacency matrixes. One algorithm is used for generating random adjacency matrixes representing either directed cyclic graphs or directed acyclic graphs. The other algorithm is used for generating directed acyclic graphs only. The paper analyses the characters of elements of an adjacency matrix, and applies a square matrix with elements falling into a Gaussian distribution and the technique of descending order to achieve a random adjacency matrix. We conduct experiments on our algorithms using MATLAB. The experimental results show that the algorithms have high efficiencies, and adjacency matrixes which represent task graphs with dozens of nodes and dozens of edges can be generated in one minute. Those random adjacency matrixes generated by the algorithms are suited for task scheduling algorithms which use random adjacency matrixes to verify validities.