羅左欣
    • Create new note
    • Create a note from template
      • Sharing URL Link copied
      • /edit
      • View mode
        • Edit mode
        • View mode
        • Book mode
        • Slide mode
        Edit mode View mode Book mode Slide mode
      • Customize slides
      • Note Permission
      • Read
        • Only me
        • Signed-in users
        • Everyone
        Only me Signed-in users Everyone
      • Write
        • Only me
        • Signed-in users
        • Everyone
        Only me Signed-in users Everyone
      • Engagement control Commenting, Suggest edit, Emoji Reply
    • Invite by email
      Invitee
    • Publish Note

      Share your work with the world Congratulations! 🎉 Your note is out in the world Publish Note

      Your note will be visible on your profile and discoverable by anyone.
      Your note is now live.
      This note is visible on your profile and discoverable online.
      Everyone on the web can find and read all notes of this public team.
      See published notes
      Unpublish note
      Please check the box to agree to the Community Guidelines.
      View profile
    • Commenting
      Permission
      Disabled Forbidden Owners Signed-in users Everyone
    • Enable
    • Permission
      • Forbidden
      • Owners
      • Signed-in users
      • Everyone
    • Suggest edit
      Permission
      Disabled Forbidden Owners Signed-in users Everyone
    • Enable
    • Permission
      • Forbidden
      • Owners
      • Signed-in users
    • Emoji Reply
    • Enable
    • Versions and GitHub Sync
    • Note settings
    • Engagement control
    • Transfer ownership
    • Delete this note
    • Save as template
    • Insert from template
    • Import from
      • Dropbox
      • Google Drive
      • Gist
      • Clipboard
    • Export to
      • Dropbox
      • Google Drive
      • Gist
    • Download
      • Markdown
      • HTML
      • Raw HTML
Menu Note settings Versions and GitHub Sync Sharing URL Create Help
Create Create new note Create a note from template
Menu
Options
Engagement control Transfer ownership Delete this note
Import from
Dropbox Google Drive Gist Clipboard
Export to
Dropbox Google Drive Gist
Download
Markdown HTML Raw HTML
Back
Sharing URL Link copied
/edit
View mode
  • Edit mode
  • View mode
  • Book mode
  • Slide mode
Edit mode View mode Book mode Slide mode
Customize slides
Note Permission
Read
Only me
  • Only me
  • Signed-in users
  • Everyone
Only me Signed-in users Everyone
Write
Only me
  • Only me
  • Signed-in users
  • Everyone
Only me Signed-in users Everyone
Engagement control Commenting, Suggest edit, Emoji Reply
  • Invite by email
    Invitee
  • Publish Note

    Share your work with the world Congratulations! 🎉 Your note is out in the world Publish Note

    Your note will be visible on your profile and discoverable by anyone.
    Your note is now live.
    This note is visible on your profile and discoverable online.
    Everyone on the web can find and read all notes of this public team.
    See published notes
    Unpublish note
    Please check the box to agree to the Community Guidelines.
    View profile
    Engagement control
    Commenting
    Permission
    Disabled Forbidden Owners Signed-in users Everyone
    Enable
    Permission
    • Forbidden
    • Owners
    • Signed-in users
    • Everyone
    Suggest edit
    Permission
    Disabled Forbidden Owners Signed-in users Everyone
    Enable
    Permission
    • Forbidden
    • Owners
    • Signed-in users
    Emoji Reply
    Enable
    Import from Dropbox Google Drive Gist Clipboard
       owned this note    owned this note      
    Published Linked with GitHub
    Subscribed
    • Any changes
      Be notified of any changes
    • Mention me
      Be notified of mention me
    • Unsubscribe
    Subscribe
    # 關於用 Pthread 取質數的問題 ###### tags: `Linux 系統與程式設計` ## 前言 從 1 - 100 之間取出所有的質數,利用 threads 來分配計算質數的範圍。 ## 一、輸出有問題 ### (一) 原本的程式 ```c #include <stdio.h> #include <unistd.h> #include <stdlib.h> #include <pthread.h> #include <semaphore.h> #include <time.h> #define NUM_THREADS 10 #define MSIZE 100 // 找出 1 - 100 的所有質數 static double getDoubleTime(); void *thread_function(void *arg); pthread_mutex_t work_mutex; int main(void) { int res; pthread_t a_thread[NUM_THREADS]; void *thread_result; int lots_of_threads; // start to measure time... double start_time = getDoubleTime(); // initialize mutex... res = pthread_mutex_init(&work_mutex, NULL); if (res != 0) { perror("Mutex initialization failed"); exit(EXIT_FAILURE); } // pthread_create... for (lots_of_threads = 0; lots_of_threads < NUM_THREADS; lots_of_threads ++) { res = pthread_create(&(a_thread[lots_of_threads]), NULL, thread_function, (void*)(long)lots_of_threads); if (res != 0) { perror("Thread creation failed"); exit(EXIT_FAILURE); } } // pthread_join... for (lots_of_threads = NUM_THREADS - 1; lots_of_threads >= 0; lots_of_threads--) { res = pthread_join(a_thread[lots_of_threads], &thread_result); if (res != 0) { perror("pthread_join failed"); } } printf("\nThread joined\n"); // stop measuring time... double finish_time = getDoubleTime(); printf("Execute Time: %.3lf ms\n", (finish_time - start_time)); exit(EXIT_SUCCESS); } void *thread_function(void *arg) { // pthread_mutex_lock(&work_mutex); int my_num = (long)arg; // if (MSIZE % NUM_THREADS != 0){ printf("error"); pthread_exit(-1); } int start_num = (MSIZE / NUM_THREADS) * my_num + 1; int end_num = (MSIZE / NUM_THREADS) * (my_num + 1); int i = 0, j = 0; // Set the loop int count = 0; // Set the counter int result = 0; // result printf("\n\nI'm thread[%d], start_num:%d, end_num:%d\n", my_num, start_num, end_num); /* find the prime number */ for (i = start_num; i <= end_num; i++) { count = 0; // Reset counter for (j = 1; j <= i; j++) { if (i % j == 0) count += 1; } if (count == 2) { result = i; printf("%d\t", result); } } // pthread_mutex_unlock(&work_mutex); pthread_exit(0); } static double getDoubleTime() { struct timeval tm_tv; gettimeofday(&tm_tv,0); return (double)(((double)tm_tv.tv_sec * (double)1000. + (double)(tm_tv.tv_usec)) * (double)0.001); } ``` * [執行結果] ![](https://i.imgur.com/HeJEnU0.jpg) ### (二) 做個測試,來看看是怎麼一回事 * 目前的假設 > 當ㄧ個 thread 還沒 printf 完它所負責範圍的質數時,就被切換到另一個 thread 裡面執行。 * 參考資料 * [Using mutex for pthread results in random answer](http://stackoverflow.com/questions/15811605/using-mutex-for-pthread-results-in-random-answer) ![](https://i.imgur.com/arQk9zI.jpg) * 驗證假設 * 為了驗證假設的正確性,我在 printf 質數時後面再補上該質數所對應的 thread number,作法如下: ```c /* 前面省略 */ /* find the prime number */ for (i = start_num; i <= end_num; i++) { count = 0; // Reset counter for (j = 1; j <= i; j++) { if (i % j == 0) count += 1; } if (count == 2) { result = i; printf("%d-[%d]\t", result, my_num); } } /* 後面省略 */ ``` * [執行結果] ![](https://i.imgur.com/EaWi8Mk.jpg) > 看來前面的假設是正確的,但是我們該如何避免這種情形? ## 二、輸出正確 ### (一) 利用陣列儲存質數、在 main() 裡面輸出陣列 * 這個方法比較繁瑣,需要事先宣告陣列來儲存質數。在執行 threads 時將對應的質數儲存至陣列,接著再回到 main() 裡面輸出結果。 ```c #include <stdio.h> #include <unistd.h> #include <stdlib.h> #include <pthread.h> #include <semaphore.h> #include <time.h> #define NUM_THREADS 10 #define MSIZE 100 // 找出 1 - 100 的所有質數 static double getDoubleTime(); void *thread_function(void *arg); pthread_mutex_t work_mutex; // 宣告 prime_array 陣列 int prime_array[NUM_THREADS][(MSIZE / NUM_THREADS)]; int main(void) { int res; pthread_t a_thread[NUM_THREADS]; void *thread_result; int lots_of_threads; int print_prime = 0; // start to measure time... double start_time = getDoubleTime(); // initialize mutex... res = pthread_mutex_init(&work_mutex, NULL); if (res != 0) { perror("Mutex initialization failed"); exit(EXIT_FAILURE); } // pthread_create... for (lots_of_threads = 0; lots_of_threads < NUM_THREADS; lots_of_threads ++) { res = pthread_create(&(a_thread[lots_of_threads]), NULL, thread_function, (void*)(long)lots_of_threads); if (res != 0) { perror("Thread creation failed"); exit(EXIT_FAILURE); } } // pthread_join... for (lots_of_threads = NUM_THREADS - 1; lots_of_threads >= 0; lots_of_threads--) { res = pthread_join(a_thread[lots_of_threads], &thread_result); if (res != 0) { perror("pthread_join failed"); } } /* 輸出 prime_array 陣列 */ int i = 0; // 設定計數器 for (lots_of_threads = 0; lots_of_threads < NUM_THREADS; lots_of_threads ++) { printf("\n\nThe thread[%d]'s numbers:\n", lots_of_threads); for (i = 0; i < (MSIZE / NUM_THREADS); i++) { if (prime_array[lots_of_threads][i] != 0) printf("%d\t", prime_array[lots_of_threads][i]); } } printf("\nThread joined\n"); // stop measuring time... double finish_time = getDoubleTime(); printf("Execute Time: %.3lf ms\n", (finish_time - start_time)); exit(EXIT_SUCCESS); } void *thread_function(void *arg) { // pthread_mutex_lock(&work_mutex); int my_num = (long)arg; // if (MSIZE % NUM_THREADS != 0){ printf("error"); pthread_exit(-1); } int start_num = (MSIZE / NUM_THREADS) * my_num + 1; int end_num = (MSIZE / NUM_THREADS) * (my_num + 1); int i = 0, j = 0, k = 0; // Set the loop int count = 0; // Set the counter int result = 0; // result printf("I'm thread[%d], start_num:%d, end_num:%d\n", my_num, start_num, end_num); /* find the prime number */ for (i = start_num; i <= end_num; i++) { count = 0; // Reset counter for (j = 1; j <= i; j++) { if (i % j == 0) count += 1; } if (count == 2) { prime_array[my_num][k] = i; k++; } } // pthread_mutex_unlock(&work_mutex); pthread_exit(0); } static double getDoubleTime() { struct timeval tm_tv; gettimeofday(&tm_tv,0); return (double)(((double)tm_tv.tv_sec * (double)1000. + (double)(tm_tv.tv_usec)) * (double)0.001); } ``` * [執行結果] ![](https://i.imgur.com/WU12UoO.jpg) ![](https://i.imgur.com/CGXHTue.jpg) ### (二) 加上 `pthread_mutex_lock()`、`pthread_mutex_unlock()` * 在 `void *thread_function(void *arg) { ... }` 裡面的開頭和結尾分別加上 `pthread_mutex_lock(&work_mutex);` 和 `pthread_mutex_unlock(&work_mutex);` ```c #include <stdio.h> #include <unistd.h> #include <stdlib.h> #include <pthread.h> #include <semaphore.h> #include <time.h> #define NUM_THREADS 10 #define MSIZE 100 // 找出 1 - 100 的所有質數 static double getDoubleTime(); void *thread_function(void *arg); pthread_mutex_t work_mutex; int main(void) { int res; pthread_t a_thread[NUM_THREADS]; void *thread_result; int lots_of_threads; // start to measure time... double start_time = getDoubleTime(); // initialize mutex... res = pthread_mutex_init(&work_mutex, NULL); if (res != 0) { perror("Mutex initialization failed"); exit(EXIT_FAILURE); } // pthread_create... for (lots_of_threads = 0; lots_of_threads < NUM_THREADS; lots_of_threads ++) { res = pthread_create(&(a_thread[lots_of_threads]), NULL, thread_function, (void*)(long)lots_of_threads); if (res != 0) { perror("Thread creation failed"); exit(EXIT_FAILURE); } } // pthread_join... for (lots_of_threads = NUM_THREADS - 1; lots_of_threads >= 0; lots_of_threads--) { res = pthread_join(a_thread[lots_of_threads], &thread_result); if (res != 0) { perror("pthread_join failed"); } } printf("\nThread joined\n"); // stop measuring time... double finish_time = getDoubleTime(); printf("Execute Time: %.3lf ms\n", (finish_time - start_time)); exit(EXIT_SUCCESS); } void *thread_function(void *arg) { pthread_mutex_lock(&work_mutex); int my_num = (long)arg; // if (MSIZE % NUM_THREADS != 0){ printf("error"); pthread_exit(-1); } int start_num = (MSIZE / NUM_THREADS) * my_num + 1; int end_num = (MSIZE / NUM_THREADS) * (my_num + 1); int i = 0, j = 0; // Set the loop int count = 0; // Set the counter int result = 0; // result printf("\n\nI'm thread[%d], start_num:%d, end_num:%d\n", my_num, start_num, end_num); /* find the prime number */ for (i = start_num; i <= end_num; i++) { count = 0; // Reset counter for (j = 1; j <= i; j++) { if (i % j == 0) count += 1; } if (count == 2) { result = i; printf("%d\t", result); } } pthread_mutex_unlock(&work_mutex); pthread_exit(0); } static double getDoubleTime() { struct timeval tm_tv; gettimeofday(&tm_tv,0); return (double)(((double)tm_tv.tv_sec * (double)1000. + (double)(tm_tv.tv_usec)) * (double)0.001); } ``` * [執行結果] ![](https://i.imgur.com/mk5tlsx.jpg) ## 三、取質數的範例程式 ```c #include <stdio.h> #include <stdlib.h> // 找出所有質數 int main(void) { int i = 0, j = 0; // 設置雙層迴圈 int count = 0; // 設置計數器 int result = 0; // 結果 int max_num = 100; // 最大整數 printf("%d 的質數有:\n", max_num); for (i = 1; i <= max_num; i++) { count = 0; // 計數器歸0 /* 當因數只有兩個,可以確認該整數為質數 */ for (j = 1; j <= max_num; j++) { if (i % j == 0) count += 1; } if (count == 2) { result = i; printf("%d\t", result); } } printf("\n"); } ```

    Import from clipboard

    Paste your markdown or webpage here...

    Advanced permission required

    Your current role can only read. Ask the system administrator to acquire write and comment permission.

    This team is disabled

    Sorry, this team is disabled. You can't edit this note.

    This note is locked

    Sorry, only owner can edit this note.

    Reach the limit

    Sorry, you've reached the max length this note can be.
    Please reduce the content or divide it to more notes, thank you!

    Import from Gist

    Import from Snippet

    or

    Export to Snippet

    Are you sure?

    Do you really want to delete this note?
    All users will lose their connection.

    Create a note from template

    Create a note from template

    Oops...
    This template has been removed or transferred.
    Upgrade
    All
    • All
    • Team
    No template.

    Create a template

    Upgrade

    Delete template

    Do you really want to delete this template?
    Turn this template into a regular note and keep its content, versions, and comments.

    This page need refresh

    You have an incompatible client version.
    Refresh to update.
    New version available!
    See releases notes here
    Refresh to enjoy new features.
    Your user state has changed.
    Refresh to load new user state.

    Sign in

    Forgot password

    or

    By clicking below, you agree to our terms of service.

    Sign in via Facebook Sign in via Twitter Sign in via GitHub Sign in via Dropbox Sign in with Wallet
    Wallet ( )
    Connect another wallet

    New to HackMD? Sign up

    Help

    • English
    • 中文
    • Français
    • Deutsch
    • 日本語
    • Español
    • Català
    • Ελληνικά
    • Português
    • italiano
    • Türkçe
    • Русский
    • Nederlands
    • hrvatski jezik
    • język polski
    • Українська
    • हिन्दी
    • svenska
    • Esperanto
    • dansk

    Documents

    Help & Tutorial

    How to use Book mode

    Slide Example

    API Docs

    Edit in VSCode

    Install browser extension

    Contacts

    Feedback

    Discord

    Send us email

    Resources

    Releases

    Pricing

    Blog

    Policy

    Terms

    Privacy

    Cheatsheet

    Syntax Example Reference
    # Header Header 基本排版
    - Unordered List
    • Unordered List
    1. Ordered List
    1. Ordered List
    - [ ] Todo List
    • Todo List
    > Blockquote
    Blockquote
    **Bold font** Bold font
    *Italics font* Italics font
    ~~Strikethrough~~ Strikethrough
    19^th^ 19th
    H~2~O H2O
    ++Inserted text++ Inserted text
    ==Marked text== Marked text
    [link text](https:// "title") Link
    ![image alt](https:// "title") Image
    `Code` Code 在筆記中貼入程式碼
    ```javascript
    var i = 0;
    ```
    var i = 0;
    :smile: :smile: Emoji list
    {%youtube youtube_id %} Externals
    $L^aT_eX$ LaTeX
    :::info
    This is a alert area.
    :::

    This is a alert area.

    Versions and GitHub Sync
    Get Full History Access

    • Edit version name
    • Delete

    revision author avatar     named on  

    More Less

    Note content is identical to the latest version.
    Compare
      Choose a version
      No search result
      Version not found
    Sign in to link this note to GitHub
    Learn more
    This note is not linked with GitHub
     

    Feedback

    Submission failed, please try again

    Thanks for your support.

    On a scale of 0-10, how likely is it that you would recommend HackMD to your friends, family or business associates?

    Please give us some advice and help us improve HackMD.

     

    Thanks for your feedback

    Remove version name

    Do you want to remove this version name and description?

    Transfer ownership

    Transfer to
      Warning: is a public team. If you transfer note to this team, everyone on the web can find and read this note.

        Link with GitHub

        Please authorize HackMD on GitHub
        • Please sign in to GitHub and install the HackMD app on your GitHub repo.
        • HackMD links with GitHub through a GitHub App. You can choose which repo to install our App.
        Learn more  Sign in to GitHub

        Push the note to GitHub Push to GitHub Pull a file from GitHub

          Authorize again
         

        Choose which file to push to

        Select repo
        Refresh Authorize more repos
        Select branch
        Select file
        Select branch
        Choose version(s) to push
        • Save a new version and push
        • Choose from existing versions
        Include title and tags
        Available push count

        Pull from GitHub

         
        File from GitHub
        File from HackMD

        GitHub Link Settings

        File linked

        Linked by
        File path
        Last synced branch
        Available push count

        Danger Zone

        Unlink
        You will no longer receive notification when GitHub file changes after unlink.

        Syncing

        Push failed

        Push successfully