S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A Worst Case Timing Analysis Technique for Multiple-Issue  Home/Search   Document Details and Download   Summary   Related Articles   Check

....was presented by LI et al. 4] But in the end, all previous surveys were either limited to more basic RISC processors [4] 6] or to single architectural properties [3] 2] Moreover, most obtained results were validated by simulation and not by using a realworld environment. LIM et al. [5] first introduced a analysis technique for multiple issue processors for their analysis framework ETS. But, they restricted their experiments to this feature and did not have meaningful validation results. That s why we moved systems in the center of our attention which contain processor ....

S. Lim, J. H. Han, J. Kim, and S. L. Min. A Worst Case Timing Analysis Technique for Multiple-Issue Machines. In Proceedings of the 19th IEEE Real-Time Systems Symposium, pages 97--108, December 1998.

....the variability in execution time and by requiring more complex analysis methods. A variety of concrete analysis methods for pipelines have been proposed, ranging over cycle accurate simulators [6, 7, 22] special purpose models using reservation tables [4, 9, 14, 21] dependence graphs [15], abstract interpretation of pipeline behavior [8, 20] and tables of instruction execution times and inter instruction effects [2, 3] The timing benefit (effect) of pipelines is to a large extent due to the overlapping of pairs of adjacent instructions. This has motivated techniques that use ....

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A Worst Case Timing Analysis Technique for Multiple-Issue Machines. In Proc. 19 IEEE Real-Time Systems Symposium (RTSS'98), December 1998.

....further divided into two stages. Global low level analysis takes features requiring a global view (caches, branch predictors) into account [5, 14, 16, 18, 20, 21, 24, 25, 33, 36] Local low level analysis considers features with local effects, like pipelines and superscalar instruction execution [9, 10, 16, 21, 22, 32, 33]. Three classes of calculation methods are mainly used: tree based calculation, pathbased calculation, and the Implicit Path Enumeration Technique (IPET) The tree based approach is limited to well structured codes, and assumes that the execution time bounds for programs can be directly derived ....

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A Worst Case Timing Analysis Technique for Multiple-Issue Machines. In Proc. 19 Dec. 1998.

....atomic unit of ow (e.g. an instruction or a basic block) given the architecture and features of the target system. For WCET analysis, instruction caches [10, 11, 15, 25] cache hierarchies [19] data caches [13, 25, 27] branch predictors [3] scalar pipelines [7, 11, 15] and superscalar CPUs [16, 24, 25] have been analysed. The purpose of the calculation phase is to calculate the WCET estimate for a program, given the program ow and global and local low level analysis results. There are three main categories of calculation methods proposed in literature: path [11, 25] the nal WCET estimate ....

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A worst case timing analysis technique for multiple-issue machines. In Proc. 19 th IEEE Real-Time Systems Symposium (RTSS'98), December 1998.

....and its neighbors. In global low level analysis, instruction caches [11, 14, 18, 29] cache hierarchies [22] data caches [16, 29, 31] and branch predictors [4] have been analyzed. Local low level analysis has built software models to deal with scalar pipelines [7, 14, 18] and superscalar CPUs [19, 28, 29]. For some complex architectures attempts have been made to use the hardware itself [25] 2 Local Low Level Analysis Calculation Global Low Level Analysis Compiler Flow Analysis WCET Program Source Input Data Timing Effect Expansion Scope Graph Traversal One Scope Path Search ....

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A worst case timing analysis technique for multiple-issue machines. In Proc. 19 th IEEE Real-Time Systems Symposium (RTSS'98), December 1998.

....Pessimistic (approximate but safe) approaches are common, e.g. assuming there is a pipeline speed up effect only when enough pipeline content information is available to guarantee the e#ect. Researchers have considered simple scalar pipelines [32, 40, 13, 23] and superscalar CPU pipelines [33, 47, 49]. Calculation The purpose of the calculation is to calculate the WCET estimate for the program, given the program flow and global and local low level analysis results. There are three main categories of calculation methods proposed in literature: path , tree ,orIPET (Implicit Path Enumeration ....

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A Worst Case Timing Analysis Technique for Multiple-Issue Machines. In Proc. 19 th IEEE Real-Time Systems Symposium (RTSS'98), December 1998.

....execution time analysis for modern processors and architectures. For fixed pipelines, the CPU pipeline analysis is relatively easy to perform because the various dependences are data independent. Several research groups combine the pipeline status with the data flow analysis to determine the WCET [8, 19, 22, 34]; this approach can be extended to the analysis of the instruction cache, since the behavior of this unit is also independent of the data values [8, 19, 32] Data caches are a second element of modern architectures that can severely influence the execution time of load and store instructions. To ....

S.-S. Lim, J. Han, J. Kim, and S. Min. A worst case timing analysis technique for multipleissue machines. In Proc. 19th IEEE Real-Time Systems Symp., pages 334--345, Madrid, Spain, December 1998. IEEE.

....atomic unit of flow (e.g. an instruction or a basic block) given the architecture and features of the target system. For WCET analysis, instruction caches [10, 11, 15, 25] cache hierarchies [19] data caches [13, 25, 27] branch predictors [3] scalar pipelines [7, 11, 15] and superscalar CPUs [16, 24, 25] have been analysed. The purpose of the calculation phase is to calculate the WCET estimate for a program, given the program flow and global and local low level analysis results. There are three main categories of calculation methods proposed in literature: path [11, 25] the final WCET estimate ....

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A worst case timing analysis technique for multiple-issue machines. In Proc. 19 th IEEE Real-Time Systems Symposium (RTSS'98), December 1998.

....a path) is appended to a path. The reservation tables are shortened if possible, by keeping only information from the beginning and the end of the path. Lim et al. focus on the R3000 processor from MIPS, which has a simple ve level integer pipeline. The more recent work of Lim, Han, Kim and Min [12] replaces the reservation tables by instruction dependence graphs. In this work they focus on a virtual processor with an idealized multiple issue pipeline. Like in [11] concatenation and pruning of paths is done during the execution of the bottom up algorithm. Lim, Han, Kim and Min don t ....

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A worst case timing analysis technique for multiple-issue machines. In Proceedings of the IEEE Real-Time Systems Symposium '98, 1998.

....is appended to a path. The reservation tables are shortened if possible, by keeping only information from the beginning and the end of the path. Lim et al. focus on the R3000 microprocessor from MIPS, which has a simple ve level integer pipeline. The more recent work of Lim, Han, Kim and Min [16] replaces the reservation tables by instruction dependence graphs. In this work they focus on a virtual microprocessor with an idealized multiple issue pipeline. Like in [15] concatenation and pruning of paths is done during the execution of the bottom up algorithm. Each concatenation step ....

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A worst case timing analysis technique for multiple-issue machines. In Proceedings of the IEEE Real-Time Systems Symposium '98, 1998.

No context found.

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A Worst Case Timing Analysis Technique for Multiple-Issue Processors. Technical Report SNU-CE-AN-98-001, Architecture and Network Laboratory, Seoul National University, 1998.

....simultaneously, we replace an edge between nodes p k 1,p k with an edge of a weight 1. Since the new edge will change the distance bounds of the IDG, we recalculate the distance bounds for the affected nodes. A more detailed description on the multiple issuing algorithm can be found in [12]. As it will be described in detail in the next section, an IDG is encoded into the PA structure that represents a program construct, and two successive IDGs are concatenated into a new IDG during the hierarchical refinement process. Repeated concatenations, however, may require a large amount of ....

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A Worst Case Timing Analysis Technique for Multiple-Issue Processors. Technical Report SNU-CE-AN-98-001, Architecture and Network Laboratory, Seoul National University, 1998.

....issued simultaneously, we replace an edge between nodes ] 1A with an edge of a weight 1. Since the new edge will change the distance bounds of the IDG, we recalculate the distance bounds for the affected nodes. A more detailed description on the multiple issuing algorithm can be found in [12]. As it will be described in detail in the next section, an IDG is encoded into the PA structure that represents a program construct, and two successive IDGs are concatenated into a new IDG during the hierarchical refinement process. Repeated concatenations, however, may require a large amount of ....

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A Worst Case Timing Analysis Technique for Multiple-Issue Processors. Technical Report SNU-CE-AN-98-001, Architecture and Network Laboratory, Seoul National University, 1998.

....simultaneously, we replace an edge between nodes p k Gamma 1; p k with an edge of a weight 1. Since the new edge will change the distance bounds of the IDG, we recalculate the distance bounds for the affected nodes. A more detailed description on the multiple issuing algorithm can be found in [12]. As it will be described in detail in the next section, an IDG is encoded into the PA structure that represents a program construct, and two successive IDGs are concatenated into a new IDG during the hierarchical refinement process. Repeated concatenations, however, may require a large amount of ....

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A Worst Case Timing Analysis Technique for Multiple-Issue Processors. Technical Report SNU-CE-AN-98-001, Architecture and Network Laboratory, Seoul National University, 1998.

No context found.

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A Worst Case Timing Analysis Technique for Multiple-Issue

No context found.

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A worst case timing analysis technique for multiple-issue machines. IEEE Real-Time Systems Symposium (RTSS'98), December 1998.

No context found.

S.-S. Lim, J. H. Han, J. Kim, and S. L. Min. A worst case timing analysis technique for multiple-issue machines. In Proceedings of the 19th Real-Time Systems Symposium (RTSS), December 1998.

No context found.

S.-S. Lim, J. Han, J. Kim, and S. Min. A worst case timing analysis technique for multiple-issue machines, Dec. 1998.

No context found.

S.-S. Lim, J. Hee Han, J. Kim, and S. Lyul Min. A Worst Case Timing Analysis Technique for Multiple Issue Machines. In Proceedings of the 19th IEEE Real-Time Systems Symposium (RTSS), 1998.

No context found.

S.-S. Lim, J. Hee Han, J. Kim, and S. Lyul Min. A Worst Case Timing Analysis Technique for Multiple Issue Machines. In Proceedings of the 19th IEEE Real-Time Systems Symposium (RTSS), 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC