Mixing
What is the correct way to call this sorting funtion in x10?
I am trying to sort an array in x10 using qsort().
First I was writing sequential code, so there were no issues. Now, I am trying to parallelize my code. Now I need to run this sort function from different places.
public def qsort_cmp_idx(var a:Long,var b:Long):Int
{
if(item_order(a)<item_order(b)) return x10.lang.Int.operator_as(-1);
else if (item_order(a)>item_order(b))
return x10.lang.Int.operator_as(1);
else return x10.lang.Int.operator_as(0);
}
x10.util.RailUtils.qsort(jump,jt,jump_siz-1,(i:Long,j:Long)=>qsort_cmp_idx(i,j));
item_order is a Rail[Long] at Place 0, and jump is a Rail[Long] at some other Place x.
What is the best way to achieve this?
x10 x10-language
asked Dec 29 '18 at 12:16
DheerajDheeraj
32
add a comment |
I am trying to sort an array in x10 using qsort().
First I was writing sequential code, so there were no issues. Now, I am trying to parallelize my code. Now I need to run this sort function from different places.
public def qsort_cmp_idx(var a:Long,var b:Long):Int
{
if(item_order(a)<item_order(b)) return x10.lang.Int.operator_as(-1);
else if (item_order(a)>item_order(b))
return x10.lang.Int.operator_as(1);
else return x10.lang.Int.operator_as(0);
}
x10.util.RailUtils.qsort(jump,jt,jump_siz-1,(i:Long,j:Long)=>qsort_cmp_idx(i,j));
item_order is a Rail[Long] at Place 0, and jump is a Rail[Long] at some other Place x.
What is the best way to achieve this?
x10 x10-language
asked Dec 29 '18 at 12:16
DheerajDheeraj
32
add a comment |
I am trying to sort an array in x10 using qsort().
First I was writing sequential code, so there were no issues. Now, I am trying to parallelize my code. Now I need to run this sort function from different places.
public def qsort_cmp_idx(var a:Long,var b:Long):Int
{
if(item_order(a)<item_order(b)) return x10.lang.Int.operator_as(-1);
else if (item_order(a)>item_order(b))
return x10.lang.Int.operator_as(1);
else return x10.lang.Int.operator_as(0);
}
x10.util.RailUtils.qsort(jump,jt,jump_siz-1,(i:Long,j:Long)=>qsort_cmp_idx(i,j));
item_order is a Rail[Long] at Place 0, and jump is a Rail[Long] at some other Place x.
What is the best way to achieve this?
x10 x10-language
asked Dec 29 '18 at 12:16
DheerajDheeraj
32
I am trying to sort an array in x10 using qsort().
First I was writing sequential code, so there were no issues. Now, I am trying to parallelize my code. Now I need to run this sort function from different places.
public def qsort_cmp_idx(var a:Long,var b:Long):Int
{
if(item_order(a)<item_order(b)) return x10.lang.Int.operator_as(-1);
else if (item_order(a)>item_order(b))
return x10.lang.Int.operator_as(1);
else return x10.lang.Int.operator_as(0);
}
x10.util.RailUtils.qsort(jump,jt,jump_siz-1,(i:Long,j:Long)=>qsort_cmp_idx(i,j));
item_order is a Rail[Long] at Place 0, and jump is a Rail[Long] at some other Place x.
What is the best way to achieve this?
x10 x10-language
x10 x10-language
asked Dec 29 '18 at 12:16
DheerajDheeraj
32
asked Dec 29 '18 at 12:16
DheerajDheeraj
32
asked Dec 29 '18 at 12:16
DheerajDheeraj
32
asked Dec 29 '18 at 12:16
DheerajDheeraj
32
asked Dec 29 '18 at 12:16
DheerajDheeraj
32
32
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
In your code snippet, the qsort_cmp_idx function that will be running at Place x needs access to data (the item_order Rail) at Place 0. In X10, an activity can only access data in the Place where it is currently running. So you need to either (a) copy in item_order to Place x before invoking qsort or (b) use the at construct within qsort_cmp_idx to temporarily shift to Place 0 to access item_order. Very likely option (a) is the best approach, because shifting from Place x to Place 0 on every comparison operation in qsort is going to be very slow.
answered Jan 2 at 18:04
Dave GroveDave Grove
612
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53969440%2fwhat-is-the-correct-way-to-call-this-sorting-funtion-in-x10%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
In your code snippet, the qsort_cmp_idx function that will be running at Place x needs access to data (the item_order Rail) at Place 0. In X10, an activity can only access data in the Place where it is currently running. So you need to either (a) copy in item_order to Place x before invoking qsort or (b) use the at construct within qsort_cmp_idx to temporarily shift to Place 0 to access item_order. Very likely option (a) is the best approach, because shifting from Place x to Place 0 on every comparison operation in qsort is going to be very slow.
answered Jan 2 at 18:04
Dave GroveDave Grove
612
add a comment |
In your code snippet, the qsort_cmp_idx function that will be running at Place x needs access to data (the item_order Rail) at Place 0. In X10, an activity can only access data in the Place where it is currently running. So you need to either (a) copy in item_order to Place x before invoking qsort or (b) use the at construct within qsort_cmp_idx to temporarily shift to Place 0 to access item_order. Very likely option (a) is the best approach, because shifting from Place x to Place 0 on every comparison operation in qsort is going to be very slow.
answered Jan 2 at 18:04
Dave GroveDave Grove
612
add a comment |
In your code snippet, the qsort_cmp_idx function that will be running at Place x needs access to data (the item_order Rail) at Place 0. In X10, an activity can only access data in the Place where it is currently running. So you need to either (a) copy in item_order to Place x before invoking qsort or (b) use the at construct within qsort_cmp_idx to temporarily shift to Place 0 to access item_order. Very likely option (a) is the best approach, because shifting from Place x to Place 0 on every comparison operation in qsort is going to be very slow.
answered Jan 2 at 18:04
Dave GroveDave Grove
612
In your code snippet, the qsort_cmp_idx function that will be running at Place x needs access to data (the item_order Rail) at Place 0. In X10, an activity can only access data in the Place where it is currently running. So you need to either (a) copy in item_order to Place x before invoking qsort or (b) use the at construct within qsort_cmp_idx to temporarily shift to Place 0 to access item_order. Very likely option (a) is the best approach, because shifting from Place x to Place 0 on every comparison operation in qsort is going to be very slow.
answered Jan 2 at 18:04
Dave GroveDave Grove
612
answered Jan 2 at 18:04
Dave GroveDave Grove
612
answered Jan 2 at 18:04
Dave GroveDave Grove
612
answered Jan 2 at 18:04
Dave GroveDave Grove
612
612
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53969440%2fwhat-is-the-correct-way-to-call-this-sorting-funtion-in-x10%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
