Runtime analysis and control method of folding indentified threads by assuming context of another thread and executing inlieu of another thread using thread folding tools

• US 8,656,399 B2
• Filed: 03/23/2012
• Issued: 02/18/2014
• Est. Priority Date: 11/23/2009
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Krauss, Kirk J.
• Primary Examiner(s): Al Kawsar, Abdullah
• Assistant Examiner(s): GHAFFARI, ABU Z
• Application Number:
  US13/428,408
• Publication Number:
  US 20120254880A1
• Time in Patent Office: 697 Days
• Field of Search: 718/102, 712/228
• US Class Current: 718/102
• CPC Class Codes: G06F 11/3017 where the computing system is implementing multitasking multiprogramming arrangements G06F9/46; allocation of resources G06F9/50
• CPC Class Codes: G06F 11/3072 where the reporting involves data filtering, e.g. pattern matching, time or event triggered, adaptive or policy-based reporting
• CPC Class Codes: G06F 11/3089 Monitoring arrangements determined by the means or processing involved in sensing the monitored data, e.g. interfaces, connectors, sensors, probes, agents software debugging using additional hardware using a specific debug interface G06F11/3656; performance evaluation by tracing or monitoring G06F11/3466
• CPC Class Codes: G06F 11/3466 Performance evaluation by tracing or monitoring
• CPC Class Codes: G06F 11/3612 by runtime analysis performance monitoring G06F11/3466
• CPC Class Codes: G06F 11/3644 by instrumenting at runtime
• CPC Class Codes: G06F 2201/865 Monitoring of software
• CPC Class Codes: G06F 9/46 Multiprogramming arrangements
• CPC Class Codes: G06F 9/48 Program initiating; Program switching, e.g. by interrupt
• CPC Class Codes: G06F 9/4843 by program, e.g. task dispatcher, supervisor, operating system
• CPC Class Codes: G06F 9/485 Task life-cycle, e.g. stopping, restarting, resuming execution G06F9/4881 takes precedence
• CPC Class Codes: G06F 9/52 Program synchronisation; Mutual exclusion, e.g. by means of semaphores

Abstract

A computer-implemented method of performing runtime analysis on and control of a multithreaded computer program. One embodiment of the present invention can include identifying threads of a computer program to be analyzed. Under control of a supervisor thread, a plurality of the identified threads can be folded together to be executed as a folded thread. The execution of the folded thread can be monitored to determine a status of the identified threads. An indicator corresponding to the determined status of the identified threads can be presented in a user interface that is presented on a display.

Claims

1. A computer-implemented method of performing runtime analysis and runtime control of a multithreaded computer program, comprising:

identifying threads of a computer program to be analyzed;

folding, under control of a supervisor thread, a plurality of the identified threads together to be executed as a single folded thread;

monitoring the execution of the folded thread to determine a status of the identified threads;

presenting in a user interface that is presented on a display at least one indicator corresponding to the determined status of the identified threads;

receiving a user selection of a first of the identified threads and a second of the identified threads;

assigning the first thread to assume a context of the second thread; and

executing, during execution of the identified threads, the first thread in lieu of the second thread when the second thread would otherwise be executed but for the first thread assuming the context.

2. The method of claim 1, further comprising:

storing state data of the first thread to a memory location.

3. The method of claim 2, wherein

the memory location is indicated by a thread tracking structure associated with the first thread.

4. The method of claim 1, wherein the folding comprises:

copying state data of the second thread, and

applying the copied state data to be used as state data for the first thread.

5. The method of claim 4, wherein

a thread that is next to the first thread in a list of folded threads is selected as the second thread.

6. The method of claim 4, wherein

the copied state data is stored to a memory location indicated by a thread tracking structure associated with the first thread.

7. The method of claim 4, further comprising:

suspending the first thread; and

suspending the second thread, wherein

the copying the state data is performed by a supervisor thread while both the first and second threads are suspended.

8. The method of claim 7, further comprising:

re-initiating execution of the first thread.

9. The method of claim 1, wherein the identifying comprises:

identifying in a list of folded threads the first thread that currently is executing; and

identifying a thread tracking structure associated with the first thread.