[특허]Efficient data processor instrumentation for systematic program debugging and development

Efficient data processor instrumentation for systematic program debugging and development 원문보기

IPC분류정보
국가/구분	United States(US) Patent 등록
국제특허분류(IPC7판)	G06F-015/82 G06F-011/34
출원번호	US-0041908 (1993-04-02)
발명자 / 주소	Papadopoulos Gregory M. (Arlington MA)
출원인 / 주소	Massachusetts Institute of Technology (Cambridge MA 02)
인용정보	피인용 횟수 : 22 인용 특허 : 0

초록 ▼

A program is first analyzed in an ideal environment that assumes infinite processing resources and zero communication latency. In this environment, the program is viewed as being comprised of a plurality of steps of computation. Each step of computation is defined as the set of instructions that have all their operands available at that time. As such, each step of computation is limited only by data dependencies. The number of instructions executed for each step of computation is counted by the data processing system. The count of instructions may be used to produce an ideal parallelism profile that produces a graphical representation of the simulation. Having established an ideal level of parallelism in the ideal environment, a more realistic profile of the maximum level of parallelism may be obtained through analusis that accounts for a finite number of processors and for communication latency. This more realistic simulation is compared to the actual level of parallelism experienced when the program is executed. Should the comparison reveal room for improvement the program is tuned to resolve problems of work distribution and contention. of processors that process tokens; comprising the step of: a) inserting in with other tokens barrier token that causes statistics maintained by the processors to be sampled and available for output; b) processing the other tokens; and c) processing the barrier token to generate the sampling of the statistics.

대표청구항 ▼

In a data processing system comprising at least one processor for executing instructions stored in memory, execution of instructions being initiated by the processing of tokens which carry operands, an instruction being executed only after all required operands are available, and the execution of some instructions generating new tokens to be processed in order to initiate execution of new instructions, a method of determining a maximum level of parallel execution of instructions that is possible with execution of a program comprised of a plurality of instructions, said method comprising the steps of: a) simulating execution of the program in multiprocessors having unlimited processing capability with respect to the program by executing the program in the at least one processor one program step at a time, each program step after a first program step processing all tokens generated in a previous program step, each program step comprising: processing with the at least one processor all tokens which are available at the start of the program step, the processing of the tokens initiating execution of all of the executable instructions whose execution is free of dependency upon unavailable operands; and storing new tokens generated during the program step for processing during a subsequent program step; and b) for each program step, counting and recording a number of instructions that are executed during the program step to produce a parallelism characteristic of the program.

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

McInerney Peter J. ; You Lawrence L. ; Wimble Michael D., Demand based generation of symbolic information.
상세보기
McInerney Peter J. ; You Lawrence L. ; Wimble Michael D., Demand-based generation of symbolic information.
상세보기
Hardwick Jonathan C.,GBX, Dynamic load balancing among processors in a parallel computer.
상세보기
Spertus, Michael P.; Fiterman, Charles; Rodriguez Rivera, Gustavo, Interactive debugging system with debug data base system.
상세보기
Harriman David J., Method and apparatus for maintaining one or more queues of elements such as commands using one or more token queues.
상세보기
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.
상세보기
Coldewey, Dirk, Method and apparatus for prefetching recursive data structures.
상세보기
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.
상세보기
Hanson Scott Patrick ; Schmidt William Jon, Method and apparatus for profiling indirect procedure calls in a computer program.
상세보기
Nordling Karl Ingmar, Method and device for a debugger and test data collector.
상세보기
Zeighami, Roy Mehdi; Johnson, Brian Matthew, Method and system for performing system-level correction of memory errors.
상세보기
Coldewey,Dirk, Method for prefetching recursive data structure traversals.
상세보기
Hardwick Jonathan C.,GBX, Parallel processing method and system using a lazy parallel data type to reduce inter-processor communication.
상세보기
Wang, Hong; Kling, Ralph; Grochowski, Edward T.; Ramakrishnan, Kalpana, Presbyopic branch target prefetch method and apparatus.
상세보기
Wang, Hong; Kling, Ralph; Grochowski, Edward T.; Ramakrishnan, Kalpana, Presbyopic branch target prefetch method and apparatus.
상세보기
Uchihira Naoshi,JPX ; Honiden Shinichi,JPX ; Ohsuga Akihiko,JPX ; Seki Toshibumi,JPX ; Nagai Yasuo,JPX ; Handa Keiichi,JPX ; Ito Satoshi,JPX ; Sawashima Nobuyuki,JPX ; Tahara Yasuyuki,JPX ; Shiotani , Programming method for concurrent programs and program supporting apparatus thereof.
상세보기
Burton, John Mark, Simulation of data processing apparatus.
상세보기
Morley John E., Software emulation system with reduced memory requirements.
상세보기
Roediger Robert Ralph ; Schmidt William Jon, Software profiler with runtime control to enable and disable instrumented executable.
상세보기
Rieschl, Michael J., Symbolic debug interface for register transfer simulator debugger.
상세보기
James S. Mattson, Jr. ; Richard F. Man, System and method for data coverage analysis of a computer program.
상세보기
Petty, Norman W., Traffic shaper that accommodates maintenance cells without causing jitter or delay.
상세보기

IPC	Description
A	생활필수품
A62	인명구조; 소방(사다리 E06C)
A62B	인명구조용의 기구, 장치 또는 방법(특히 의료용에 사용되는 밸브 A61M 39/00; 특히 물에서 쓰이는 인명구조 장치 또는 방법 B63C 9/00; 잠수장비 B63C 11/00; 특히 항공기에 쓰는 것, 예. 낙하산, 투출좌석 B64D; 특히 광산에서 쓰이는 구조장치 E21F 11/00)
A62B-1/08	.. 윈치 또는 풀리에 제동기구가 있는 것

내보내기 구분	파일저장 인쇄 메일전송
구성항목	기본정보 상세정보 관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표IPC 관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 공고번호, 공고일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표출원인, 출원인국적, 출원인주소, 발명자, 발명자E, 발명자코드, 발명자주소, 발명자 우편번호, 발명자국적, 대표IPC, IPC코드, 요약, 미국특허분류, 대리인주소, 대리인코드, 대리인(한글), 대리인(영문), 국제공개일자, 국제공개번호, 국제출원일자, 국제출원번호, 우선권, 우선권주장일, 우선권국가, 우선권출원번호, 원출원일자, 원출원번호, 지정국, Citing Patents, Cited Patents
저장형식	Text(ASCII format) Excel format PIAS분석(.xls)
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	총 건의 자료가 검색되었습니다. 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오. ~ Text(ASCII format) Excel format

연합인증

Efficient data processor instrumentation for systematic program debugging and development 원문보기

초록 ▼

대표청구항 ▼

연구과제 타임라인

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

관련 콘텐츠

특허 원문 보기

IPC 상위 출원인

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

선택된 텍스트

연합인증

Efficient data processor instrumentation for systematic program debugging and development 원문보기

초록 ▼

대표청구항 ▼

연구과제 타임라인

전체(0) 논문(0) 특허(0) 보고서(0)

전체(0) 논문(0) 특허(0) 보고서(0)

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

관련 콘텐츠

특허 원문 보기

IPC 상위 출원인

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

선택된 텍스트