HP Computing #18
bshambaugh
started this conversation in
Ideas
Replies: 1 comment
-
**Rationale: Further Areas to Explore:** |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Original: Google Groups - HP Computing
seeAlso : Wireframes
seeAlso: YouTube Wireframe Animation
ch_1_2_P2PArch (HP Computing)
{transcript}
s1)
Clicking on the Find Nodes button in the HP Computing Panel brings up a dialogue to find and save nodes
based on certain criteria. These criteria are in part inspired by a paper by Buyya et al. titled,
"Economic Models for resource management and Scheduling in Grid Computing". At least the time to compute
and the cost is.
I can select all computing nodes that promise to solve my job in a certain amount of time, or at a certain cost.
I can also have a combination of time and cost, in other words a rate.
I can also select nodes within a certain geographic distance from the present location if selected alone or from
a certain geographic location if it is selected as well.
I can also find nodes by common interest (using perhaps cosine similarity). Pressing the query button, and
clicking the show map button shows all nodes satisfying the criteria.
I can select nodes individually that appear in the list or map or select them all. Then I can click "Save As" to save my collection of nodes for use in High Performance Computing for my Applications.
References Include:
Rajkumar Buyya et al., Economic models for resource management and sharing in Grid computing, Concurrency and Computation: Practice and Experience, 2002, 14:1507 - 1542, http://gridbus.cs.mu.oz.au/papers/emodelsgrid.pdf
Beta Was this translation helpful? Give feedback.
All reactions