並列摘要
We present a technique for finding a lower bound on the number of processors needed to achieve a given schedule of an algorithm represented as a dag for a Diophantine system. The application of this technique is illustrated with a tensor product computation. We then provide a time-minimal processor schedule that meets the computed processor lower bounds, including the one for tensor product. We produce a formula for the number of lattice points in the convex polyhedron that are scheduled for a particular time step (which is a lower bound on the number of processors needed to satisfy the schedule). This is done by constructing a system of parametric linear Diophantine equations whose solutions represent the lattice points of interest. Our principal contribution to lower bounds in the algorithm and its implementation for constructing the generating function from which a formula for the number of these solutions is produced.
被引用紀錄
延伸閱讀
- Li, X., & Zhang, S. (2017). A Real-Time Structure of Attitude Algorithm for High Dynamic Bodies. Journal of Control Science and Engineering, 2017(), 1-8-069. https://doi.org/10.1155/2017/9542423
- Bhuvana, J. (2015). A Hybrid Evolutionary Algorithm for Discrete Optimization. Research Journal of Applied Sciences, Engineering and Technology, 9(9), 770-777. https://www.airitilibrary.com/Article/Detail?DocID=20407467-201503-201506090034-201506090034-770-777
- AHMED, N. U., & XIANG, X. (1995). NECESSARY CONDITIONS OF OPTIMALITY FOR INFINITE DIMENSIONAL UNCERTAIN SYSTEMS. Mathematical Problems in Engineering, 1995(), 179-191. https://doi.org/10.1155/S1024123X95000123
- Hu, L. X., & Jia, X. M. (2014). Global Asymptotic Stability of a Rational System. Abstract and Applied Analysis, 2014(), 539-544-359. https://doi.org/10.1155/2014/286375
- Guerman, A., Seabra, A., & Smirnov, G. (2011). Optimization of Parameters of Asymptotically Stable Systems. Mathematical Problems in Engineering, 2011(), 677-695-142. https://doi.org/10.1155/2011/526167