MIT 6.s081 Lab1 素数筛

最新推荐文章于 2024-09-13 16:51:30 发布

destiny44123

最新推荐文章于 2024-09-13 16:51:30 发布

阅读量144

点赞数

文章标签：课程设计

本文链接：https://blog.csdn.net/destiny44123/article/details/129388371

版权

该文描述了一个使用管道实现并发版本的素数筛程序。程序基于DougMcIlroy的构思，通过创建管道和进程来高效筛选素数。每个进程会检查并传递非素数给下一个进程，直到所有35以下的数字处理完毕。程序在读取管道关闭时结束，并确保所有子进程都已终止。

摘要由CSDN通过智能技术生成

Question

Write a concurrent version of prime sieve using pipes. This idea is due to Doug McIlroy, inventor of Unix pipes. The picture halfway down this page and the surrounding text explain how to do it. Your solution should be in the file user/primes.c.
使用管道写一个并发版本的素数筛。
Some hints:

Be careful to close file descriptors that a process doesn’t need, because
otherwise your program will run xv6 out of resources before the first process reaches 35.
Once the first process reaches 35, it should wait until the entire pipeline terminates, including all children, grandchildren, &c. Thus the main primes process should only exit after all the output has been printed, and after all the other primes processes have exited.
Hint: read returns zero when the write-side of a pipe is closed.
It’s simplest to directly write 32-bit (4-byte) ints to the pipes, rather than using formatted ASCII I/O.
You should create the processes in the pipeline only as they are needed.
Add the program to UPROGS in Makefile.

Solution

void prime(int p[]){
    
    int c[2];
    int ans;    
    if(!read(p[0],&ans,4))
        exit(0);    
    printf("prime %d\n",ans);
    pipe(c);
    if(fork()==0){
        close(p[0]);
        close(c[1]);
        prime(c);
    }
    else{
        close(c[0]);
        int num;
        while(read(p[0],&num,4)){            
            if(num%ans!=0)
                write(c[1],&num,4);
        }
        close(p[0]);
        close(c[1]);
        wait((int *) 0);
    }
}

int
main(int argc, char *argv[])
{
  int p[2];
  pipe(p);
  for(int i=2;i<=35;i++){
    int n=i;
    write(p[1],&n,4);
  }
  close(p[1]);
  prime(p);
  exit(0);
}

```