Self configuring peer to peer inter process messaging system
First Claim
1. A method for peer-to-peer messaging between network resources comprising:
- communicating with a first process by writing a first text file in a first scratch space, where the first text file describes at least one of a first set of information that a second process has generated and a first action to be performed on the first set of information;
detecting, by a first arbiter, the first text file, wherein the first arbiter is implemented by the first process;
performing at least one of;
implementing, by the first arbiter, the first action, andapplying, by the first arbiter, logic embedded within the first arbiter to determine actions to be performed on the first text file;
communicating with a third process independently from a central master control system by writing a second text file in a second scratch space, wherein the second text file describes at least one of a second set of information that the first process has displayed and a second action to be performed on the second set of information;
detecting, by a second arbiter, the second text file, wherein the second arbiter is implemented by the third process; and
performing at least one of;
implementing, by the second arbiter, the second action, andapplying, by the second arbiter, logic embedded within the second arbiter to determine actions to be performed on the second text file.
0 Assignments
0 Petitions
Accused Products
Abstract
A method for peer-to-peer messaging between network resources is described. The method includes communicating with a first process by writing a first text file in a first scratch space, where the first text file describes at least one of at least a first set of information that a second process has generated and at least a first action to be performed on the first set of information, detecting, by a first arbiter, the first text file, where the first arbiter is implemented by the first process, and performing at least one of implementing, by the first arbiter, the first action, and applying, by the first arbiter, logic embedded within the first arbiter to determine actions to be performed on the first text file.
13 Citations
31 Claims
-
1. A method for peer-to-peer messaging between network resources comprising:
-
communicating with a first process by writing a first text file in a first scratch space, where the first text file describes at least one of a first set of information that a second process has generated and a first action to be performed on the first set of information; detecting, by a first arbiter, the first text file, wherein the first arbiter is implemented by the first process; performing at least one of; implementing, by the first arbiter, the first action, and applying, by the first arbiter, logic embedded within the first arbiter to determine actions to be performed on the first text file; communicating with a third process independently from a central master control system by writing a second text file in a second scratch space, wherein the second text file describes at least one of a second set of information that the first process has displayed and a second action to be performed on the second set of information; detecting, by a second arbiter, the second text file, wherein the second arbiter is implemented by the third process; and performing at least one of; implementing, by the second arbiter, the second action, and applying, by the second arbiter, logic embedded within the second arbiter to determine actions to be performed on the second text file. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A method for peer-to-peer messaging between network resources comprising:
-
communicating with a first process by writing a first text file in a first scratch space, where the first text file describes at least one of a first set of information that a second process has generated and a first action to be performed on the first set of information, wherein said first text file drives the first process on a first computer having a first operating system and wherein said second process is on a second computer having a second operating system without messaging systems of said first operating system being resident on said second operating system; detecting, by a first arbiter, the first text file, wherein the first arbiter is implemented by the first process; and performing at least one of; implementing, by the first arbiter, the first action, and applying, by the first arbiter, logic embedded within the first arbiter to determine actions to be performed on the first text file. - View Dependent Claims (20)
-
-
21. A method for peer-to-peer messaging between network resources comprising:
-
communicating with a first process by writing a first text file in a first scratch space, where the first text file describes at least one of a first set of information that a second process has generated and a first action to be performed on the first set of information that the second process has generated; detecting, by a first arbiter, the first text file, wherein the first arbiter is implemented by the first process independently from a master control system; and determining, by the first arbiter independently from a master control system, that the first text file includes a match with the first process, and performing at least one of; implementing, by the first arbiter independently from a master control system, the first action, and applying, by the first arbiter independently from a master control system, logic embedded within the first arbiter to determine actions to be performed on the first text file. - View Dependent Claims (22, 23, 24, 25)
-
-
26. A method for peer-to-peer messaging between network resources comprising:
-
communicating with a first process by writing a first text file in a first scratch space, where the first text file describes at least one of a first set of information that a second process has generated and a first action to be performed on the first set of information that the second process has generated; detecting, by a first arbiter, the first text file, wherein the first arbiter is implemented by the first process; and performing at least one of; implementing, by the first arbiter and independently from a central master control system, the first action; and applying, by the first arbiter and independently from a central master control system, logic embedded within the first arbiter to determine actions to be performed on the first text file. - View Dependent Claims (27, 28, 29, 30, 31)
-
Specification