Abstract
Scheduling algorithm always plays an important role in the spatial architecture for the contradiction between the finite network bandwidth and the abundant execution resources. This article provides a simple method to solve the contention for network resource in one of the spatial architecture, i.e. the tera-op, reliable, intelligently adaptive processing system (TRIPS) processor. The method improves the performance of network by increasing the bypass bandwidth which can transmit the data in the internal of every execution unit, and converting the proportion of remote communication by the deep scheduling algorithm. The deeply optimized algorithm is realized to verify the validity of the method, and the performance increase 9% for floating point spec2000 benchmark is got.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
NOWATZKI T, SARTIN-TARMM, CARLI L D, et al. A General Constraint-centric Scheduling Framework for Spatial Architectures [C]// Proceedings of the 34th Annual ACMSIGPLAN Conference on Programming Language Design and Implementation. Seattle, USA: ACM, 2013: 1–12.
WAINGOLD E, TAYLOR M, SRIKRISHNA D, et al. Baring it all to software: Raw machines [J]. Computer, 1997, 30(9): 86–93.
SWANSON S, MICHELSON K, SCHWERIN A, et al. Wavescalar [C]// Proceedings of the 36th International Symposium on Microarchitecture. [s.l.]: IEEE, 2003: 1–12.
BURGER D, KECKLER S W, MCKINLEY K S, et al. Scaling to the end of silicon with EDGE architectures [J]. IEEE Computer, 2004, 37(7): 44–55.
WATKINS M A, CIANCHETTI M J, ALBONESI D H. Shared reconfigurable architectures for CMPs. [C]// International Conference on Field Programmable Logic & Applications. [s.l.]: IEEE, 2008: 299–304.
GOVINDARAJU V, HO C H, NOWATZKI T, et al. Dyser: Unifying functionality and parallelism specialization for energy efficient computing [J]. IEEE Micro, 2012, 33(5): 38–50.
ESMAEILZADEH H, SAMPSON A, CEZE L, et al. Neural acceleration for general-purpose approximate programs [J]. IEEE Micro, 2013, 33(3): 16–27.
NAGARAJAN R, KUSHWAHA S K, BURGER D, et al. Static placement, dynamic issue (SPDI) scheduling for edge architectures [C]// Proceedings of the 13th International Conference on Parallel Architecture and Compilation Techniques. [s.l.]: IEEE, 2004: 74–84.
GRATZ P, SANKARALINGAM K, HANSON H, et al. Implementation and evaluation of a dynamically routed processor operand network [C]// Proceedings of the First International Symposium on Networks-on-Chip. [s.l.]: IEEE, 2007: 7–17
COONS K E, CHEN X, KUSHWAHA S K, et al. A spatial path scheduling algorithm for EDGE architectures [C]// Proceedings of the 12th International Conference on Architectural Support for Programming Languages and Operating Systems. [s.l.]: IEEE, 2006: 129–140.
GOU P F, LI Q B, JIN Y H, et al. M5 based edge architecture modeling [C]// Proceedings of IEEE International Conference on Computer Design. Netherlands: Amsterdam: IEEE, 2010: 289–296.
ROBATMILI B, COONS K E, BURGER D, et al. Strategies for mapping dataflow blocks to distributed hardware [C]// In International Symposium on Microarchitecture. [s.l.]: IEEE, 2008: 23–34.
KIM C, SETHUMADHAVAN S, GOVINDAN M S, et al. Composable lightweight processors [C]// In International Symposium on Microarchitecture. [s.l.]: IEEE, 2007: 381–394.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, C., Yu, M. & Yang, B. A simple method to solve the network congestion for spitial architcture. J. Shanghai Jiaotong Univ. (Sci.) 22, 72–76 (2017). https://doi.org/10.1007/s12204-017-1802-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12204-017-1802-z