{"title":"异构处理环境下自动映射算法的问题表示","authors":"C. Leangsuksun, J. Potter","doi":"10.1109/WHP.1993.664365","DOIUrl":null,"url":null,"abstract":"We presents two heterogeneous processing (HP) problem representations that are 1) a program representation called a \"Meta Graph\" and 2) a targeted HP hardware configuration representation called an \"Architecture Graph\". These representations are inputs to an automatic mapping algorithm for HP environments [ 181. The paper discusses the definitions of the proposed representations and initial experimental results.","PeriodicalId":235913,"journal":{"name":"Proceedings. Workshop on Heterogeneous Processing,","volume":"350 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Problem Representations for an Automatic Mapping Algorithm on Heterogeneous Processing Environments\",\"authors\":\"C. Leangsuksun, J. Potter\",\"doi\":\"10.1109/WHP.1993.664365\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We presents two heterogeneous processing (HP) problem representations that are 1) a program representation called a \\\"Meta Graph\\\" and 2) a targeted HP hardware configuration representation called an \\\"Architecture Graph\\\". These representations are inputs to an automatic mapping algorithm for HP environments [ 181. The paper discusses the definitions of the proposed representations and initial experimental results.\",\"PeriodicalId\":235913,\"journal\":{\"name\":\"Proceedings. Workshop on Heterogeneous Processing,\",\"volume\":\"350 7\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Workshop on Heterogeneous Processing,\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WHP.1993.664365\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Workshop on Heterogeneous Processing,","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WHP.1993.664365","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Problem Representations for an Automatic Mapping Algorithm on Heterogeneous Processing Environments
We presents two heterogeneous processing (HP) problem representations that are 1) a program representation called a "Meta Graph" and 2) a targeted HP hardware configuration representation called an "Architecture Graph". These representations are inputs to an automatic mapping algorithm for HP environments [ 181. The paper discusses the definitions of the proposed representations and initial experimental results.