有效地求解模块化线性管道的动态规划问题

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings] Pub Date : 1992-04-01 DOI:10.1109/PCCC.1992.200542

J. Myoupo

{"title":"有效地求解模块化线性管道的动态规划问题","authors":"J. Myoupo","doi":"10.1109/PCCC.1992.200542","DOIUrl":null,"url":null,"abstract":"The authors present a fully pipelined modular linear systolic algorithm for dynamic programming. They use geometric considerations to design the array. Its characteristics make it fully-pipelined. It runs in 1.5n/sup 2/+O(n) time steps on an array of n/sup 2//6+O(n) processors.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Solving dynamic programming problems efficiently on modular linear pipelines\",\"authors\":\"J. Myoupo\",\"doi\":\"10.1109/PCCC.1992.200542\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present a fully pipelined modular linear systolic algorithm for dynamic programming. They use geometric considerations to design the array. Its characteristics make it fully-pipelined. It runs in 1.5n/sup 2/+O(n) time steps on an array of n/sup 2//6+O(n) processors.<<ETX>>\",\"PeriodicalId\":250212,\"journal\":{\"name\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1992.200542\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1992.200542","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

提出了一种求解动态规划的全流水线模块化线性收缩算法。他们使用几何因素来设计阵列。它的特点使其完全流水线化。它在一个由n/sup 2//6+O(n)个处理器组成的阵列上以1.5n/sup 2/+O(n)个时间步长运行。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Solving dynamic programming problems efficiently on modular linear pipelines

The authors present a fully pipelined modular linear systolic algorithm for dynamic programming. They use geometric considerations to design the array. Its characteristics make it fully-pipelined. It runs in 1.5n/sup 2/+O(n) time steps on an array of n/sup 2//6+O(n) processors.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]

自引率

0.00%

发文量