Patent US5134705A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5134705A Expired / Lapsed US ⏱️ 0.0 years remaining

System and method for concurrency simulation

Assignee: Unisys Corp
•
Filing: 1988-10-21
•
Granted: 1992-07-28
•
Expires: 2008-10-21
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A system and method which assumes that the process being evaluated is written in a highly concurrent language or at least is capable of high degree of concurrent operations. The parameters employed in the simulated concurrent performance have a direct affect on performance time.

Inventors

  • 👤 Robert C. Smith
  • 👤 William C. Hopkins

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 11:29
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/30; G06F11/34; G06F11/3457; G06F11/3404; G06F8/00; G06F8/40; G06F8/41; G06F8/45

Claims Analysis

Total Claims: 9
Claim 1
Independent Claim 257 words
In a data processing system having a memory, a first processor coupled to said memory and an input/output device coupled to said memory, a method of simulating concurrent execution by a parallel processor system of a routine written in a given program language having points of concurrency therein, said method comprising: (a) transmitting to said first processor from said memory, a sequence of code of said routine expressed in said given program language, which routine is to have its concurrent execution by said parallel processor system simulated; (b) executing said sequence of code for a given set of input data and storing a sequence of steps employed in said code execution; (c) recording information related to said execution of said sequence of code associated with each of said steps including the time required therefore; (d) reading said stored sequence of steps via said first processor and determining points of concurrency via said first processor where parallel execution of said code may be performed; (e) entering a first set of insertions into said stored sequence of steps at a plurality of said points of concurrency to specify separate subroutines for parallel execution; (f) defining said parallel processor system including the number of processor elements employed in said parallel processor system and the execution delay associated with spawning a new process; and (g) performing a first simulation via said first processor of the execution of said routine as a plurality of subroutines executed by said defined parallel processor system using said stored steps, said insertions, and said recorded information.
Claim 2
Dependent Claim 257 words
In a data processing system having a memory, a first processor coupled to said memory and an input/output device coupled to said memory, a method of simulating concurrent execution by a parallel processor system of a routine written in a given program language having points of concurrency therein, said method comprising: (a) transmitting to said first processor from said memory, a sequence of code of said routine expressed in said given program language, which routine is to have its concurrent execution by said parallel processor system simulated; (b) executing said sequence of code for a given set of input data and storing a sequence of steps employed in said code execution; (c) recording information related to said execution of said sequence of code associated with each of said steps including the time required therefore; (d) reading said stored sequence of steps via said first processor and determining points of concurrency via said first processor where parallel execution of said code may be performed; (e) entering a first set of insertions into said stored sequence of steps at a plurality of said points of concurrency to specify separate subroutines for parallel execution; (f) defining said parallel processor system including the number of processor elements employed in said parallel processor system and the execution delay associated with spawning a new process; and (g) performing a first simulation via said first processor of the execution of said routine as a plurality of subroutines executed by said defined parallel processor system using said stored steps, said insertions, and said recorded information.
Claim 3
Dependent Claim 19 words
A method according to claim 1 further comprising the step of: (h) measuring the performance of said first simulation.
Claim 4
Dependent Claim 31 words
A method according to claim 2 wherein: said program language is a functional language and said points of concurrency occur when a combinator requires evaluation of two or more strict arguments.
Claim 5
Dependent Claim 32 words
A method according to claim 2 wherein: said programming language is an ALGOL type language and said points of concurrency occur when an operator does not require results of immediately previous operations.
Claim 6
Dependent Claim 29 words
A method according to claim 2 wherein: said routine is a natural language parser and said points of concurrency occur when a subject has two or more predicate definitions.
Claim 7
Dependent Claim 75 words
A method according to claim 2 further including the steps of: performing a second simulation via said first processor of the execution of said routine, said second simulation comprising the steps of repeating said steps (f), (g), and (h) using a second definition of said parallel processor system which alters the manner in which said defined parallel processor system performs; and comparing said measurements of said first simulation to said measurements of said second simulation.
Claim 8
Dependent Claim 67 words
A method according to claim 2 further comprising the steps of: performing a second simulation via said first processor of the execution of said routine, said simulation comprising the steps of repeating said steps (d), (e), (g), and (h) for a second set of insertions which alters the method of concurrency employed; and comparing said measurements of said first simulation to said measurements of said second simulation.
Claim 9
Dependent Claim 14 words
A method according to claim 1 wherein: said first processor is a sequential processor.

References Cited (Backward Citations)

US4432051A Cited
US4435758A Cited
US4502118A Cited
US4583164A Cited
US4466061A Cited
US4468736A Cited
US4809159A Cited
US4807115A Cited
US4847755A Cited
US4825360A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-07-28 1996-01-27 1996-07-28 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-07-28 2000-01-27 2000-07-28 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-07-28 2004-01-27 2004-07-28 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag