{"title":"Optimal allocation of computational resources in VLSI","authors":"Z. Kedem","doi":"10.1109/SFCS.1982.32","DOIUrl":null,"url":null,"abstract":"The purpose of our research whose prel iminary resul ts are reported here is to examine the following question: ~iven chiP ~ A, 1!!! 19 optimalli .!lloc.!~ .il 8IImJ 1/Q, !UD9.!:Y, and wiriy (internal <XIIIDUD.i.cation) so that sane function of interest can ~ cauputed .!p th;m:~~!Y minimtm !~.!? -P-;;h. suprisingly, the geanetric nature of the model makesit sufficiently \"structured\" so that meaningful study of the consequences of such allocatim for the purpose of designing provably optimal chips is feasibl e. ( I t is interesting to contrast this situation with the one in unstructured models, where simi! ar attempts at fomsal treatment of optimal allocation 00 not seem to be as fruitful.) Our resul ts pennit us to CXJDPletely characterize both the 8llount of resources required and their allocation for certain ccmputations, and to obtain previously proved lower bounds (which generally accomted for sane of the resources, or restricted their util ization in sane way) for certain fmctions as special cases, by invoking explicit constraints.","PeriodicalId":127919,"journal":{"name":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1982.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
The purpose of our research whose prel iminary resul ts are reported here is to examine the following question: ~iven chiP ~ A, 1!!! 19 optimalli .!lloc.!~ .il 8IImJ 1/Q, !UD9.!:Y, and wiriy (internal