$\require{mediawiki-texvc}$

연합인증

연합인증 가입 기관의 연구자들은 소속기관의 인증정보(ID와 암호)를 이용해 다른 대학, 연구기관, 서비스 공급자의 다양한 온라인 자원과 연구 데이터를 이용할 수 있습니다.

이는 여행자가 자국에서 발행 받은 여권으로 세계 각국을 자유롭게 여행할 수 있는 것과 같습니다.

연합인증으로 이용이 가능한 서비스는 NTIS, DataON, Edison, Kafe, Webinar 등이 있습니다.

한번의 인증절차만으로 연합인증 가입 서비스에 추가 로그인 없이 이용이 가능합니다.

다만, 연합인증을 위해서는 최초 1회만 인증 절차가 필요합니다. (회원이 아닐 경우 회원 가입이 필요합니다.)

연합인증 절차는 다음과 같습니다.

최초이용시에는
ScienceON에 로그인 → 연합인증 서비스 접속 → 로그인 (본인 확인 또는 회원가입) → 서비스 이용

그 이후에는
ScienceON 로그인 → 연합인증 서비스 접속 → 서비스 이용

연합인증을 활용하시면 KISTI가 제공하는 다양한 서비스를 편리하게 이용하실 수 있습니다.

[미국특허] Unified compiler framework for control and data speculation with recovery code 원문보기

IPC분류정보
국가/구분 United States(US) Patent 등록
국제특허분류(IPC7판)
  • G06F-009/45
출원번호 US-0132558 (1998-08-11)
발명자 / 주소
  • Ju Dz-Ching
출원인 / 주소
  • Hewlett-Packard Company
인용정보 피인용 횟수 : 76  인용 특허 : 18

초록

A method and system for scheduling computer instructions for execution as part of a compilation process in which an original computer program that defines a set of operations is compiled to produce an executable program. The method may schedule instructions in a different execution order from the or

대표청구항

[ What is claimed is:] [1.]1. A method for scheduling execution of computer instructions, within a portion of an original computer program that defines a run-time operation, to produce a scheduled portion of the computer program that performs the defined run-time operation upon execution on a comput

이 특허에 인용된 특허 (18) 인용/피인용 타임라인 분석

  1. Panwar Ramesh ; Hetherington Ricky C., Apparatus for executing coded dependent instructions having variable latencies.
  2. Ross Jonathan K. ; Mills Jack D. ; Hays James O. ; Burger Stephen G. ; Morris Dale C. ; Thompson Carol L. ; Gupta Rajiv ; Freudenberger Stefan M. ; Hammond Gary N. ; Kling Ralph M., Computer architecture for the deferral of exceptions on speculative instructions.
  3. Dubey Pradeep Kumar ; Barton Charles Marshall ; Chuang Chiao-Mei ; Lam Linh Hue ; O'Brien John Kevin ; O'Brien Kathryn Mary, Executing speculative parallel instructions threads with forking and inter-thread communication.
  4. Schlansker Michael S. ; Kathail Vinod, Flexible scheduling of non-speculative instructions.
  5. Ebcioglu Kemal ; Silberman Gabriel Mauricio, Handling of exceptions in speculative instructions.
  6. Dubey Pradeep Kumar, Method and apparatus for biasing cache LRU for prefetched instructions/data based upon evaluation of speculative condit.
  7. Faraboschi Paolo ; Such-Vicente Alberto,ESX, Method and apparatus for protecting memory-mapped devices from side effects of speculative instructions.
  8. Henstrom Alexander P. ; Martell Robert W., Method and apparatus for recovering the state of a speculatively scheduled operation in a processor which cannot be ex.
  9. Kathail Vinod K. (Cupertino CA) Gupta Rajiv (Los Altos CA) Rau Bantwal R. (Los Altos CA) Schlansker Michael S. (Los Altos CA) Worley ; Jr. William S. (Breckenridge CO) Amerson Frederic C. (Santa Clar, Method and system for deferring exceptions generated during speculative execution.
  10. Gupta Rajiv ; Karp Alan H., Method and system for selecting instructions for re-execution for in-line exception recovery in a speculative execution.
  11. Loper Albert J. (Cedar Park TX) Mallick Soummya (Austin TX) Putrino Michael (Austin TX), Method for executing speculative load instructions in high-performance processors.
  12. Moudgill Mayan, Multiple issue static speculative instruction scheduling with path tag and precise interrupt handling.
  13. Dangelo Carlos, Object-oriented multi-media architecture.
  14. Schlansker Michael S. ; Kathail Vinod, Reducing the number of executed branch instructions in a code sequence.
  15. Adler Michael C. (Lexington MA) Hobbs Steven O. (Westford MA) Lowney Paul G. (Concord MA), Software mechanism for accurately handling exceptions generated by speculatively scheduled instructions.
  16. Cohn Robert ; Adler Michael C. ; Lowney Paul Geoffrey, Software mechanism for reducing exceptions generated by speculatively scheduled instructions.
  17. Tran Thang ; Witt David B. ; Johnson William M., Superscalar microprocessor including a high speed instruction alignment unit.
  18. Mendelson Avi,ILX ; Gabbay Freddy,ILX, System and method for concurrent processing.

이 특허를 인용한 특허 (76) 인용/피인용 타임라인 분석

  1. Derrick R. Meyer ; Stephan G. Meier ; Norbert Juffa, Apparatus and method for superforwarding load operands in a microprocessor.
  2. Ishizaki, Kazuaki, Automatically enabling a read-only cache in a language in which two arrays in two different variables may alias each other.
  3. Zhang, Wenjie; Tang, Xinan, Checking for memory access collisions in a multi-processor architecture.
  4. Cui, Shimin; Silvera, Raul Esteban, Code motion based on live ranges in an optimizing compiler.
  5. Shtilman, Dmitri; Panchenko, Maksim V.; Wang, Fu-Hwa, Code transformation to optimize fragments that implement constant loading.
  6. Koseki,Akira; Komatsu,Hideaki, Compiler and register allocation method.
  7. Kawahito, Motohiro; Komatsu, Hideaki, Compiler device, method, program and recording medium.
  8. Kawahito,Motohiro; Komatsu,Hideaki, Compiler device, method, program and recording medium.
  9. Ramani, Srinivasan; Taneja, Rohit, Compiler that performs register promotion optimizations in regions of code where memory aliasing may occur.
  10. Clarke,Stephen, Compiling computer programs including branch instructions.
  11. Ishizaki,Kauaki; Inagaki,Tatshushi; Komatsu,Hideaki, Compiling method, apparatus, and program.
  12. Lim,Chu Cheow; Du,Zhao Hui; Ngai,Tin Fook, Computation of all-pairs reaching probabilities in software systems.
  13. Krueger,Steven E., Computer-implemented exception handling system and method.
  14. Krueger,Steven E., Computer-implemented system and method for generating embedded code to add functionality to a user application.
  15. Schultz, Ulrik Pagh; Muller, Gilles; Consel, Charles; Clausen, Lars; Goire, Christian, Data compaction method for an intermediate object code program executable in an onboard system provided with data processing resources and corresponding onboard system with multiple applications.
  16. McCrady, Donald James; Ringseth, Paul F.; Mehta, Bimal, Data flow analysis of transactional processes.
  17. Srinivasan, Uma; Nomura, Kevin; Ju, Dz-ching, Data speculation within modulo scheduled loops.
  18. Anthony Cocchi ; Janice Cynthia Shepherd, Determination of local variable type and precision in the presence of subroutines.
  19. Denisart, Jean-Luc; Meier, Alain; Bonacci, Enzo; Pleisch, HansPeter; Talon, Christian, Device for preparing a liquid beverage from a cartridge.
  20. Sweeney, Timothy Dean, Dual mode evaluation for programs containing recursive computation.
  21. Bantz, David F.; Mastrianni, Steven J.; Moulic, James R.; Shea, Dennis G., Dynamic optimization of mobile services.
  22. Bantz, David F.; Mastrianni, Steven J.; Moulic, James R.; Shea, Dennis G., Dynamic optimization of mobile services.
  23. Murakami, Hirofumi, Electronic equipment and log output method.
  24. Rawsthorne,Alasdair; Sandham,John H.; Souloglou,Jason, Exception handling method and apparatus for use in program code conversion.
  25. Wang, Cheng; Wu, Youfeng, Expediting execution time memory aliasing checking.
  26. Martin, Allan Russell, Extension of swing modulo scheduling to evenly distribute uniform strongly connected components.
  27. Robison, Arch D., Fast tree-based generation of a dependence graph.
  28. Gschwind, Michael K., Forming instruction groups based on decode time instruction optimization.
  29. Gschwind, Michael K., Forming instruction groups based on decode time instruction optimization.
  30. Gschwind, Michael K., Forming instruction groups based on decode time instruction optimization.
  31. Gschwind, Michael K., Forming instruction groups based on decode time instruction optimization.
  32. Sachs,Howard G.; Arya,Siamak, Instruction cache association crossbar switch.
  33. Chen, William Y., Instruction reducing predicate copy.
  34. Christopher M. McKinsey ; Jayashankar Bharadwaj, Interactive instruction scheduling and block ordering.
  35. Grice, Matthew B., Just-ahead-of-time compilation.
  36. Metzger,Markus T., Method and apparatus for compiling code.
  37. Erik Altman ; Michael K. Gschwind, Method and apparatus for reordering memory operations along multiple execution paths in a processor.
  38. Gibson, James Douglas; Bhatia, Rohit, Method and apparatus for resteering failing speculation check instructions.
  39. Cheng, Buqi; Ngai, Tin-Fook; Du, Zhaohui; Zhang, PeiNan, Method and system for intermediate representation of source code.
  40. Jourdan, Stephan J.; Gabbay, Freddy; Ronen, Ronny; Yoaz, Adi, Method and system for safe data dependency collapsing based on control-flow speculation.
  41. Jourdan,Stephan J.; Gabbay,Freddy; Ronen,Ronny; Yoaz,Adi, Method and system for safe data dependency collapsing based on control-flow speculation.
  42. Bonaventure,Damien; McInnes,James Lawrence, Method for minimizing spill in code scheduled by a list scheduler.
  43. Ju, Dz-ching, Methods and apparatus for preserving precise exceptions in code reordering by using control speculation.
  44. Ju,Dz ching, Methods and apparatus for preserving precise exceptions in code reordering by using control speculation.
  45. Buskens, Richard Wayne; Gonzalez, Oscar; Ren, Yansong, Methods and devices for recovering from initialization failures.
  46. Fu,Chen; Chen,Dong Yuan; Wu,Chengyong; Ju,Dz Ching, Methods and systems for integrated scheduling and resource management for a compiler.
  47. Debate, Jeremy; Alexander, Aaron A.; Villamil, Ricardo; Seibel, James P., Modification of compiled applications and application management using retrievable policies.
  48. Shidla,Dale John; Barr,Andrew Harvey; Pomaranski,Ken Gary, Opportunistic pattern-based CPU functional testing.
  49. Gschwind, Michael K., Optimization of instruction groups across group boundaries.
  50. Gschwind, Michael K., Optimization of instruction groups across group boundaries.
  51. Adl-Tabatabai, Ali-Reza; de Lima Ottoni, Guilherme; Paleczny, Michael, Optimizing intermediate representation of script code for fast path execution.
  52. Adl-Tabatabai, Ali-Reza; de Lima Ottoni, Guilherme; Paleczny, Michael, Optimizing intermediate representation of script code for fast path execution.
  53. Ramani, Srinivasan; Taneja, Rohit, Performing register promotion optimizations in a computer program in regions where memory aliasing may occur and executing the computer program on processor hardware that detects memory aliasing.
  54. Colavin, Osvaldo; Rizzo, Davide, Predicated execution using operand predicates.
  55. Forsyth, Andrew T.; Bradford, Dennis R.; Hall, Jonathan C., Processing memory access instructions that have duplicate memory indices.
  56. Ramani, Srinivasan; Taneja, Rohit, Processor that detects memory aliasing in hardware and assures correct operation when memory aliasing occurs.
  57. Ramani, Srinivasan; Taneja, Rohit, Processor that detects memory aliasing in hardware and assures correct operation when memory aliasing occurs.
  58. Ramani, Srinivasan; Taneja, Rohit, Processor that includes a special store instruction used in regions of a computer program where memory aliasing may occur.
  59. Wilkerson, Christopher B.; Srinivasan, Srikanth T.; Ju, Dz-ching, Runtime critical load/data ordering.
  60. Bradford, Jeffrey P.; Luick, David A., System and method for a group priority issue schema for a cascaded pipeline.
  61. Hank,Richard Eugene, System and method for assigning basic blocks to computer control flow paths.
  62. Hank,Richard Eugene, System and method for merging control flow paths.
  63. Luick, David A., System and method for optimization within a group priority issue schema for a cascaded pipeline.
  64. Luick, David A., System and method for prioritizing arithmetic instructions.
  65. Luick, David A., System and method for prioritizing branch instructions.
  66. Luick, David A., System and method for prioritizing compare instructions.
  67. Luick, David A., System and method for prioritizing store instructions.
  68. Farouki,Karim T.; Radigan,James J., System and method for register allocation using SSA construction.
  69. Luick, David A, System and method for the scheduling of load instructions within a group priority issue schema for a cascaded pipeline.
  70. Fleehart, Timothy G.; Pincus, Jonathan D.; Wallace, Jeffrey S., System and method for whole-system program analysis.
  71. Fleehart,Timothy G.; Pincus,Jonathan D.; Wallace,Jeffrey S., System and method for whole-system program analysis.
  72. Kurien, James A.; Koutsoukos, Xenofon; Su, Rong, Systems and methods for distributed fault diagnosis using precompiled finite state automata.
  73. Jarrett, James H.; Belcher, John E.; Brandes, Russell W.; Brooks, Jeffery W.; Christensen, Bruce A.; Hogan, Keith M.; Kalan, Michael D.; Reichard, Douglas J.; Ritchie, Diane N.; Rodano, Thomas G.; Taylor, Mark E.; Varga, Rae M., Systems and methods that facilitate management of add-on instruction generation, selection, and/or monitoring during execution.
  74. Jarrett, James H.; Belcher, John E.; Brandes, Russell W.; Brooks, Jeffery W.; Christensen, Bruce A.; Hogan, Keith M.; Kalan, Michael D.; Reichard, Douglas J.; Ritchie, Diane N.; Rodano, Thomas G.; Taylor, Mark E.; White, Rae M., Systems and methods that facilitate management of add-on instruction generation, selection, and/or monitoring during execution.
  75. Nair, Sreekumar Ramakrishnan, Using value-expression graphs for data-flow optimizations.
  76. Sachs, Howard G.; Arya, Siamak, VLIW processor and method therefor.

활용도 분석정보

상세보기
다운로드
내보내기

활용도 Top5 특허

해당 특허가 속한 카테고리에서 활용도가 높은 상위 5개 콘텐츠를 보여줍니다.
더보기 버튼을 클릭하시면 더 많은 관련자료를 살펴볼 수 있습니다.

섹션별 컨텐츠 바로가기

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

AI-Helper 아이콘
AI-Helper
안녕하세요, AI-Helper입니다. 좌측 "선택된 텍스트"에서 텍스트를 선택하여 요약, 번역, 용어설명을 실행하세요.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.

선택된 텍스트

맨위로