$\require{mediawiki-texvc}$

연합인증

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

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

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

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

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

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

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

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

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

Method and apparatus for compiling computer programs with interproceduural register allocation 원문보기

IPC분류정보
국가/구분 United States(US) Patent 등록
국제특허분류(IPC7판)
  • G06F-009/44
  • G06F-009/45
출원번호 US-0435914 (1989-11-13)
발명자 / 주소
  • Odnert Daryl (Boulder Creek CA) Santhanam Vatsa (Sunnyvale CA)
출원인 / 주소
  • Hewlett-Packard Company (Palo Alto CA 02)
인용정보 피인용 횟수 : 56  인용 특허 : 0

초록

Optimization techniques are implemented by means of a program analyzer used in connection with a program compiler to optimize usage of limited register resources in a computer processor. The first optimization technique, called interprocedural global variable promotion allows the global variables of

대표청구항

A method of operating a general purpose data processor having a plurality of machine registers, a sub-set thereof being assigned for use as interprocedural registers, so as to allow more efficient allocation of said interprocedural registers when said data processor is executing a computer program c

이 특허를 인용한 특허 (56)

  1. Caldwell Jeffrey B. ; Muttart Harry Charles ; Gross David Henry, Automatic compiler restructuring of COBOL programs into a proc per paragraph model.
  2. Gschwind, Michael K., Call sequence generation based on type of routine.
  3. Bosworth, Adam; Bau, III, David; Vasilik, Kenneth Eric, Cell based data processing.
  4. Koseki, Akira; Komatsu, Hideaki, Compiler register allocation and compilation.
  5. Koseki,Akira; Komatsu,Hideaki, Compiler register allocation and compilation.
  6. Peyton ; Jr. John T. ; de Jong Stuart, Compiler with inter-modular procedure optimization.
  7. Tanaka, Akira, Compiling device, computer-readable recording medium on which a compiling program is recorded and a compiling method.
  8. Blainey Robert James,CAX ; Donawa Christopher Michael,CAX ; McInnes James Lawrence,CAX, Connectivity based program partitioning.
  9. Walker, Douglas Jay; Turner, Bryan C.; Toebes, John, Distributed client services based on execution of service attributes and data attributes by multiple nodes in resource groups.
  10. Walker, Douglas Jay; Turner, Bryan C.; Toebes, John, Distributed client services based on execution of service attributes and data attributes by multiple nodes in resource groups.
  11. Walker, Douglas Jay; Turner, Bryan C.; Toebes, John, Distributed client services based on execution of service attributes and data attributes by multiple nodes in resource groups.
  12. Turner, Bryan C.; Toebes, John; Walker, Douglas Jay, Distributed computing based on multiple nodes with determined capacity selectively joining resource groups having resource requirements.
  13. Turner, Bryan C.; Toebes, John; Walker, Douglas Jay, Distributed computing based on multiple nodes with determined capacity selectively joining resource groups having resource requirements.
  14. Turner, Bryan C.; Toebes, John; Walker, Douglas Jay, Distributed computing based on multiple nodes with determined capacity selectively joining resource groups having resource requirements.
  15. Gschwind, Michael K., Executing instructions to store context information based on routine to be executed.
  16. Verbitsky,George, Expanding a software program by insertion of statements.
  17. Bortnikov, Vita; Lambert, David John; Mendelson, Bilha; Roediger, Robert Ralph; Schmidt, William Jon; Shavit-Lottem, Inbal, Generating and utilizing organized profile information.
  18. Blainey Robert James,CAX ; Donawa Christopher Michael,CAX ; McInnes James Lawrence,CAX, Global variable coalescing.
  19. Razdan Rahul ; Smith Michael D., Hardware extraction technique for programmable reduced instruction set computers.
  20. Kushlis,Robert J, Inter-procedure global register allocation method.
  21. Dehnert James Craig ; Hiranandani Seema ; Ho Wingshun Wilson ; Leung Lilian H., Interprocedural analysis user interface.
  22. Archambault,Roch Georges, Interprocedural dead store elimination.
  23. Gschwind, Michael K., Marking external sibling caller routines.
  24. Gschwind, Michael K., Marking external sibling caller routines.
  25. Gschwind, Michael K., Marking sibling caller routines.
  26. Grove Daniel D., Method and apparatus for addressing extended registers on a processor in a computer system.
  27. Clifford N. Click, Jr. ; Christopher A. Vick ; Michael H. Paleczny, Method and apparatus for allocating stack slots.
  28. Metzger,Markus T., Method and apparatus for compiling code.
  29. Odnert Daryl (Boulder Creek CA) Santhanam Vatsa (Sunnyvale CA), Method and apparatus for compiling computer programs with interprocedural register allocation.
  30. Eidt Erik L., Method and apparatus for distinguishing reference values from non-reference values in a runtime environment.
  31. Eidt, Erik L., Method and apparatus for distinguishing reference values from non-reference values in a runtime environment.
  32. Erik L. Eidt, Method and apparatus for distinguishing reference values from non-reference values in a runtime environment.
  33. Bortnikov Vita,ILX ; Mendelson Bilha,ILX ; Novick Mark,ILX ; Roediger Robert Ralph ; Schmidt William Jon ; Shavit-Lottem Inbal,ILX, Method and apparatus for modular reordering of portions of a computer program based on profile data.
  34. Bortnikov Vita,ILX ; Mendelson Bilha,ILX ; Novick Mark,ILX ; Schmidt William Jon ; Shavit-Lottem Inbal,ILX, Method and apparatus for profile-based reordering of program portions in a computer program.
  35. Benitez Manuel Enrique, Method and apparatus for transforming multiplications into product table lookup references.
  36. Archambault, Roch Georges; Cui, Shimin, Method and system for reducing memory reference overhead associated with threadprivate variables in parallel programs.
  37. Archambault, Roch Georges; Cui, Shimin, Method and system for reducing memory reference overhead associated with treadprivate variables in parallel programs.
  38. Ju Dz Ching ; Muthukumar Kalyan ; Ramaswamy Shankar ; Simons Barbara Bluestein, Method of, system for, and computer program product for providing efficient utilization of memory hierarchy through code restructuring.
  39. Ju, Dz Ching; Muthukumar, Kalyan; Ramaswamy, Shankar; Simons, Barbara Bluestein, Method of, system for, and computer program product for providing efficient utilization of memory hierarchy through code restructuring.
  40. Fuhler, Richard A.; Pennello, Thomas J.; Jalkut, Michael Lee; Warnes, Peter, Methods and apparatus for compiling instructions for a data processor.
  41. Fuhler,Richard A.; Pennello,Thomas J.; Jalkut,Michael Lee; Warnes,Peter, Methods and apparatus for compiling instructions for a data processor.
  42. Chessin Stephen Alan ; Evans Rodrick Ison ; Walker Michael S., Methods, computer program products, and apparatus for initializing global registers.
  43. Bosworth, Adam; Bau, III, David; Vasilik, Kenneth Eric, Multi-language execution method.
  44. Makarov, Vladimir, Performing register allocation of program variables based on priority spills and assignments.
  45. Tsuboi, Akira, Process and apparatus for optimizing program written in interpretive language for each callable program part base on frequency of executions.
  46. Koseki,Akira; Kawachiya,Kiyokuni, Program conversion method, data processing apparatus and program.
  47. Russell, Jeffry Thomas, Program slicing for codesign of embedded systems.
  48. George, Biju; Lueh, Guei-Yuan, Register liveness analysis for SIMD architectures.
  49. George, Biju; Lueh, Guei-Yuan, Register liveness analysis for SIMD architectures.
  50. Goebel Kurt, Register resource allocation feedback.
  51. Chakrabarti,Dhruva Ranjan; Liu,Shin Ming, Scalable cross-file inlining through locality-based transformation ordering.
  52. Tip,Frank; Palsberg,Jens, Scalable propagation-based methods for call graph construction.
  53. Gschwind, Michael K., Suppressing storing of context information.
  54. Koseki, Akira; Takeuchi, Mikio; Komatsu, Hideaki, Systems and methods for efficiently using stack registers and storage medium therefor.
  55. Lapkowski, Christopher A.; Stoodley, Kevin A., Use of name mangling techniques to encode cross procedure register assignment.
  56. Serra Bill ; Drudis Antoni N., Visualization method and system for dynamically displaying operations of a program.
섹션별 컨텐츠 바로가기

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

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

선택된 텍스트

맨위로