Log in
Register
Give us Feedback
InviteGroup: TextGrid
This groups contains members of the TextGrid project, which is part of the German D-Grid initiative.
Created at: Tuesday 09 December 2008 @ 16:03:38 (GMT)
Owner
No news
Note: some items may not be visible to you, due to viewing permissions.
Workflow
|
Original Uploader |
Created: 09/12/08 @ 15:57:14
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is a GWorkflowDL representation of a multi choice (OR Split) that invokes either A or B or A and B.
Rating: 0.0 / 5 (0 ratings) | Versions: 2 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 118 times | Downloaded: 47 times Tags (6): |
 View
 Download (v2)
|
Workflow
|
Original Uploader |
Created: 19/01/09 @ 12:58:17
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is a GWorkflowDL representation of a synchronization (AND Join) that waits until A and B finish their execution.
This workflow is equivalent to the following pseudo code:
threadA = new Thread( end_A = A() );
threadB = new Thread( end_B = B() );
threadA.join();
threadB.join();
Rating: 0.0 / 5 (0 ratings) | Versions: 2 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 66 times | Downloaded: 24 times Tags (7): |
View
Download (v2)
|
Workflow
|
Original Uploader |
Created: 09/12/08 @ 16:00:03
Credits:
Attributions:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is a GWorkflowDL representation of a structured loop that counts from 0 to 99.
This workflow is equivalent to the following pseudo code:
for ( i:=0; i
Please remark that this demonstration workflow does not invoke any external services at all.
Rating: 0.0 / 5 (0 ratings) | Versions: 2 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 108 times | Downloaded: 36 times Tags (6): |
View
Download (v2)
|
Workflow
|
Original Uploader |
Created: 25/11/08 @ 13:44:02 | Last updated: 25/11/08 @ 13:45:33
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is an example of the execution of an arbitrary command line program. This workflow transfers a tar.gz package containing the linux program "date" to a free Grid resource, unpacks, and executes it. After execution the URL to the file with the standard output is available on "stdout", the standard error on "stderr".
Rating: 0.0 / 5 (0 ratings) | Versions: 1 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 104 times | Downloaded: 62 times Tags (6): |
View
Download (v1)
|
Workflow
|
Original Uploader |
Created: 25/11/08 @ 13:17:49
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This is a trivial test workflow modeled using the Grid Workflow Description Language (GWorkflowDL), which can be executed by means of the Grid Workflow Execution Service (GWES).
Rating: 0.0 / 5 (0 ratings) | Versions: 1 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 79 times | Downloaded: 53 times Tags (2): |
View
Download (v1)
|
Workflow
|
Original Uploader |
Created: 09/12/08 @ 15:58:50
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is a GWorkflowDL representation of a structured loop that updates the variable "x" in each iteration.
This workflow is equivalent to the following pseudo code:
x:=0;
for ( i:=0; i<=99; i++) {
x:=x+i;
}
x_result:=x;
Please remark that this demonstration workflow does not invoke any external services at all. The calculation is done only by using the GWorkflowDL's syntax and semantics.
Rating: 0.0 / 5 (0 ratings) | Versions: 2 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 250 times | Downloaded: 95 times Tags (6): |
View
Download (v2)
|
Workflow
|
Original Uploader |
Created: 03/12/08 @ 14:49:47 | Last updated: 19/01/09 @ 13:56:32
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is a GWorkflowDL representation of a simple merge (XOR Join) that invokes C when either A or B has been invoked.
The structure of the GWorkflowDL representation of a simple merge is identical to the multi merge pattern!
Rating: 0.0 / 5 (0 ratings) | Versions: 1 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 64 times | Downloaded: 29 times Tags (7): |
View
Download (v1)
|
Workflow
|
Original Uploader |
Created: 09/12/08 @ 16:00:38
Credits:
Attributions:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is an alternative GWorkflowDL representation of a structured loop that updates the variable "x" in each iteration and which models the control flow separately from the index "i".
Here a version of the graph with manual graph layout:
This workflow is equivalent to the following pseudo code:
x:=0;
for ( i:=0; i<=99; i++) {
x:=x+i;
}
x_result:=x;
Please remark that this demonstration workflow does not invoke any external services at all. The c...
Rating: 0.0 / 5 (0 ratings) | Versions: 2 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 230 times | Downloaded: 48 times Tags (7): |
View
Download (v2)
|
Workflow
|
Original Uploader |
Created: 03/12/08 @ 14:25:25 | Last updated: 03/12/08 @ 14:45:16
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is a GWorkflowDL representation of a parallel split that invokes A and B recurrently without synchronization.
This workflow is equivalent to the following pseudo code:
new Thread( end_A = A() );
new Thread( end_B = B() );
Rating: 0.0 / 5 (0 ratings) | Versions: 1 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 41 times | Downloaded: 23 times Tags (7): |
View
Download (v1)
|
Workflow
|
Original Uploader |
Created: 09/12/08 @ 15:54:59
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is a GWorkflowDL representation of an exclusive choice (XOR Split) that invokes either A or B.
This workflow is equivalent to the following pseudo code:
x = XOR_Split;
if (x=="true") {
end_A = A(x);
} else {
end_B = B(x);
}
Rating: 0.0 / 5 (0 ratings) | Versions: 2 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 54 times | Downloaded: 33 times Tags (7): |
View
Download (v2)
|
Workflow
|
Original Uploader |
Created: 03/12/08 @ 14:17:20
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is a GWorkflowDL representation of a sequence that sequentially invokes A and B.
This workflow is equivalent to the following pseudo code:
end_A = A();
end_B = B(end_A);
Rating: 0.0 / 5 (0 ratings) | Versions: 1 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 54 times | Downloaded: 31 times Tags (6): |
View
Download (v1)
|
Workflow
|
Original Uploader |
Created: 17/12/08 @ 09:54:59
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This is a first test workflow that demonstrate, how to use the GWES for a document-style Web Service within TextGrid.
Rating: 0.0 / 5 (0 ratings) | Versions: 2 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 84 times | Downloaded: 36 times Tags (5): |
View
Download (v2)
|
Workflow
|
Original Uploader |
Created: 17/12/08 @ 09:56:52
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
Test workflow that invokes CRUD read on ingrid.
Rating: 0.0 / 5 (0 ratings) | Versions: 1 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 162 times | Downloaded: 68 times Tags (6): |
View
Download (v1)
|
Workflow
|
Original Uploader |
Created: 19/01/09 @ 13:18:36
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is a GWorkflowDL representation of a structured synchronizing merge that invokes either A or B or A and B and merges to one branch afterwards.
Rating: 0.0 / 5 (0 ratings) | Versions: 2 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 74 times | Downloaded: 30 times Tags (6): |
View
Download (v2)
|
Workflow
|
Original Uploader |
Created: 19/01/09 @ 13:48:02 | Last updated: 19/01/09 @ 13:49:27
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is a GWorkflowDL representation of a multi merge that invokes C after each invocation of A or B.
Rating: 0.0 / 5 (0 ratings) | Versions: 2 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 70 times | Downloaded: 30 times Tags (5): |
View
Download (v2)
|
Workflow
|
Original Uploader |
Created: 19/01/09 @ 14:17:53 | Last updated: 19/01/09 @ 16:54:13
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is a GWorkflowDL representation of a structured discriminator (1-out-of-M Join) that invokes C after the first invocation of A or B (M=2). All next (M-1) invocations of A or B are ignored. This is only one out of various possibilities to model this workflow pattern.
Notice alternative representation of this pattern at http://www.myexperiment.org/workflows/632
Rating: 0.0 / 5 (0 ratings) | Versions: 2 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 76 times | Downloaded: 24 times Tags (6): |
View
Download (v2)
|
Workflow
|
Original Uploader |
Created: 06/01/09 @ 16:48:30
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is a GWorkflowDL representation of a cancelling discriminator that cancels the invocation of B if A has been executed and vice versa. This is only one out of various possibilities to model this workflow pattern.
Please regard that this workflow example uses a separate method for cancelling the invocation of the activity. This is very useful if the invocation of the activity is done asynchronously as it is often implemented for long running methods. It may be necessary to propag...
Rating: 0.0 / 5 (0 ratings) | Versions: 1 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 43 times | Downloaded: 24 times Tags (6): |
View
Download (v1)
|
Workflow
|
Original Uploader |
Created: 06/01/09 @ 16:57:00
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is a GWorkflowDL representation of a structured partial join (N-out-of-M join) that invokes D after N=2 invocations of A or B or C (M=3). All next (M-N) invocations of A or B or C are ignored. This is only one out of various possibilities to model this workflow pattern.
Rating: 0.0 / 5 (0 ratings) | Versions: 1 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 109 times | Downloaded: 22 times Tags (6): |
View
Download (v1)
|
Workflow
|
Original Uploader |
Created: 19/01/09 @ 16:53:28 | Last updated: 20/01/09 @ 08:40:11
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is an alternative GWorkflowDL representation of a structured discriminator (1-out-of-M Join) that invokes C after the first invocation of A or B (M=2). All next (M-1) invocations of A or B are ignored. The pattern is resets if both, A and B have been invoked.
Please note that the transitions "C", "ignore", and "release" have different priorities (not shown in the graph) that make the net deterministic (except the occurrence of "A" and &q...
Rating: 0.0 / 5 (0 ratings) | Versions: 1 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 57 times | Downloaded: 18 times Tags (6): |
View
Download (v1)
|
Workflow
|
Original Uploader |
Created: 20/01/09 @ 10:53:56
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is a GWorkflowDL representation of a blocking discriminator (1-out-of-M Join) that invokes C after the first invocation of A or B (M=2). All next (M-1) invocations of A or B are ignored and the AND transition is blocked. The pattern is resets if both, A and B have been invoked. Then the next token on "begin" can be processed.
Please note that the transitions "C", "ignore", and "release" have different priorities (represented by p0, p1, an...
Rating: 0.0 / 5 (0 ratings) | Versions: 1 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 64 times | Downloaded: 20 times Tags (6): |
View
Download (v1)
|
Workflow
|
Original Uploader |
Created: 20/01/09 @ 11:36:59
Credits:
License: Creative Commons Attribution-Share Alike 3.0 Unported License
This workflow is an alternative GWorkflowDL representation of a structured discriminator (1-out-of-M Join) that invokes C after the first invocation of A or B (M=2). All next (M-1) invocations of A or B are ignored for the same data group. Other tokens on the place "begin" can be processed recurrently if they belong to another data group.
Please note that the transitions "C" and "ignore" have different priorities (not shown in the graph) that make the net determ...
Rating: 0.0 / 5 (0 ratings) | Versions: 1 | Reviews: 0 | Comments: 0 | Citations: 0 Viewed: 109 times | Downloaded: 26 times Tags (6): |
View
Download (v1)
|
No credits yet
Linked Data
Non-Information Resource URI: http://www.myexperiment.org/groups/127
Alternative Formats
Copyright © 2007 - 2011 The University of Manchester and University of Southampton
No comments yet
Log in to make a comment