1 Overview Proposal Title : Preprocessing for Modulo Scheduling
نویسنده
چکیده
Proposal Title: Preprocessing for Modulo Scheduling within Open-Source ARM Cortex-A8 Compiler Principal Investigator (PI): Gang-Ryung Uh, Associate Professor Co-Principal Investigator (Co-PI): David Whalley, Professor Mailing Address of PI: MEC 302-N, Computer Science Department, Boise State University 1910 University Drive, Boise, ID 83725, USA Emails of PI and Co-PI: [email protected] and [email protected] Telephone Numbers of PI and Co-PI: (208) 426-5691 and (850) 644-3506 Affiliations: Boise State University and Florida State University Google contact: Dr. Brad Chen Google sponsor: Dr. Stephen Hines
منابع مشابه
Preprocessing Strategy for Effective Modulo Scheduling on Multi-issue Digital Signal Processors
To achieve high resource utilization for multi-issue Digital Signal Processors (DSPs), production compilers commonly include variants of the iterative modulo scheduling algorithm. However, excessive cyclic data dependences, which exist in communication and media processing loops, often prevent the modulo scheduler from achieving ideal loop initiation intervals. As a result, replicated functiona...
متن کاملRequirements Evolution and Evolution Requirements with Constrained Goal Models
We are interested in supporting software evolution caused by changing requirements and/or changes in the operational environment of a software system. For example, users of a system may want new functionality or performance enhancements to cope with growing user population (changing requirements). Alternatively, vendors of a system may want to minimize costs in implementing requirements changes...
متن کاملA Fast Algorithm for Computing Binomial Coefficients Modulo Powers of Two
I present a new algorithm for computing binomial coefficients modulo 2N. The proposed method has an O(N3·Multiplication(N)+N4) preprocessing time, after which a binomial coefficient C(P, Q) with 0≤Q≤P≤2N-1 can be computed modulo 2N in O(N2·log(N)·Multiplication(N)) time. Multiplication(N) denotes the time complexity of multiplying two N-bit numbers, which can range from O(N2) to O(N·log(N)·log(...
متن کاملModulo-Type Precoding for Networks
In this chapter, we address scenarios where the tasks of (modulo-type) precoding for the multiple-input/multiple-output (MIMO) broadcast channel, network coding with its associated finite-field matrix channel, and channel coding meet or complement each other. By enlightening dualities, similarities, and differences between the areas and corresponding schemes, a deeper understanding of theirmutu...
متن کاملPlanning in a cross dock network with an operational scheduling overview
Nowadays, cross docking plays an important role in the supply chain networks especially in transportation systems. According to the cross dock system advantages such as reducing transportation costs, lead times, and inventories, scheduling in a cross-dock center would be more complicated by increasing the number of suppliers, customers and product types. Considering the cross dock limited capac...
متن کامل