Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Finding of relative process activity

IP.com Disclosure Number: IPCOM000130540D
Original Publication Date: 2005-Oct-26
Included in the Prior Art Database: 2005-Oct-26
Document File: 2 page(s) / 60K

Publishing Venue

IBM

Abstract

With this process a program can understand if a specific process belong to the same product is active or not.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 77% of the total text.

Page 1 of 2

Finding of relative process activity

The main idea is to use an hierarchically tree view of the pids in order to verify if another process ranning in the same process tree are up and running.

Following there is an example.

This is an hierarchically view of the processes:

     Usually if for example the process "Child_1.2 Subtree" need to know if the process "Child_2.1.2 Subtree" is up and runnig and if it doesn't know the pid of this process begin to visit all the process tree starting from root until a process that has the name "Child_2.1.2 Subtree" was found. If the process tree has a very elevated number of branches the performance of the process would drastically decrease during the visit of the all tree and subtree.

The our idea is to start from the "Child_1.2 Subtree" go up in the process tree pid until the root and then go down only in the subtree related hierarchically to process "Child_2.1.1 Subtree". If this pid is present this means that this is up and running. In this way for this example only 5 nodes of the tree will be visited (Child_1 Subtree, Root_process Tree, Child_2 Subtree, Child_2.1 Subtree, Child_2.1.2 Subtree) insteand of 9 nodes.

Another very meaningful example is the following.

If "Child_2.1.2" has to check if "Child_2.1.1" is up and running with our approach only 2 nodes need to be visited, with classic ones 8 nodes. If the root nodes is very distant from the two processes that we want analyze the number of nodes that with our approach will b...