Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8104769
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 5, 20262026-06-05T23:58:28+00:00 2026-06-05T23:58:28+00:00

How can I speed up a recursive code using OpenMP? Basically, I have to

  • 0

How can I speed up a recursive code using OpenMP? Basically, I have to speed up the S function in the program here. The code is as below.

void S(Oct* oct, unsigned int l) {
    S(oct, l+1);
    A(oct, l);
    S(oct, l+1);
    AR(oct,l);
}
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-05T23:58:30+00:00Added an answer on June 5, 2026 at 11:58 pm

    Looking at your code, I would say the code is not parallelizable. Since S() is a recursive function, adding openmp pragma inside the function would lead to overhead of creating threads. It wouldn’t really improve the performance. Moreover, you shouldn’t parallelize those other functions, A() and AR(), as well. It will also create the same overhead performance problem.

    I would suggest either to parallelize the source code that invokes S() in the first place, or to break down the code to eliminate recursion (then you might have a possibility to parallelize using openmp).

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

When using P/Invoke, adding [SuppressUnmanagedCodeSecurity] can speed calls from managed code into unmanaged code
I have seen Javascript code that claims to speed up function call overhead like:
Following a question posted here about how I can increase the speed on one
How can I measure the speed of code written in Java? I planning to
We can speed up a hibernate app easyly with 2nd level cache using infinispan
In Delphi you can speed up your code by passing parameters as const ,
Wondering if I can speed up the search. I need to build a functionality
When we can get good speed with OpenGL since it uses texture memory and
How can I regulate a speed of rotation tile icon? Is it possible?
How can I slow the speed of uploading a file in my local development?

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.