- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hi:
I would like to inmplenet the code by IPP:
A is a array pointer, which may be float or int with size n:
B is a integer array pointer, to save the index of A which element is greater that zero.
int ith = 0;
for(int i = 0; i< n; i++){
if(A > 0)
B[ith++] = i;
}/*for i*/
as you know, the bottleneck is the cashe exchange, A and B could mapping the same cashe line, that make slow.
is there useful function in ipp to implement that?
thank you.
I would like to inmplenet the code by IPP:
A is a array pointer, which may be float or int with size n:
B is a integer array pointer, to save the index of A which element is greater that zero.
int ith = 0;
for(int i = 0; i< n; i++){
if(A > 0)
B[ith++] = i;
}/*for i*/
as you know, the bottleneck is the cashe exchange, A and B could mapping the same cashe line, that make slow.
is there useful function in ipp to implement that?
thank you.
Link Copied
1 Reply
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
You might be able to implement such a search using a combination of the Threshhold and FindNearest functions. Here are some links to those functions:
http://software.intel.com/sites/products/documentation/hpc/composerxe/en-us/ippxe/ipp_manual_lnx/hh_goto.htm#IPPS/ipps_ch5/functn_Threshold_LT.htm
http://software.intel.com/sites/products/documentation/hpc/composerxe/en-us/ippxe/ipp_manual_lnx/hh_goto.htm#IPPS/ipps_ch5/functn_FindNearest.htm
http://software.intel.com/sites/products/documentation/hpc/composerxe/en-us/ippxe/ipp_manual_lnx/hh_goto.htm#IPPS/ipps_ch5/functn_Threshold_LT.htm
http://software.intel.com/sites/products/documentation/hpc/composerxe/en-us/ippxe/ipp_manual_lnx/hh_goto.htm#IPPS/ipps_ch5/functn_FindNearest.htm

Reply
Topic Options
- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Printer Friendly Page