-
Notifications
You must be signed in to change notification settings - Fork 16
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'master' of git.nic.uoregon.edu:/gitroot/tau2
Former-commit-id: 76fa8e08d949fbf93eef086cc79d8ed507db3920
- Loading branch information
Showing
52 changed files
with
2,397 additions
and
609 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Submodule apex
updated
from d52498 to bc636d
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,105 @@ | ||
| /* | ||
| ** Program to illustrate the use of MPI_Comm_spawn() to create | ||
| ** new processes on-the-fly. | ||
| */ | ||
|
|
||
| #include <stdio.h> | ||
| #include <stdlib.h> | ||
| #include <sys/types.h> | ||
| #include <unistd.h> | ||
| #include "mpi.h" | ||
|
|
||
| #define MASTER 0 | ||
| #define BUFSIZE 1024 | ||
| #define NUM2SPAWN 2 | ||
|
|
||
| int main( int argc, char *argv[], char ** envp ) | ||
| { | ||
| int rank; | ||
| int size; | ||
| int np = NUM2SPAWN; | ||
| char message[BUFSIZE]; | ||
| MPI_Comm parentcomm, spawnedcomm, allcomm; | ||
|
|
||
| MPI_Init(&argc, &argv); | ||
| pid_t pid = getpid(); | ||
| /* This function provides a convenient way to determine whether | ||
| ** this process is part of the original communicator (has a null | ||
| ** parent), or part of the newly spawned communicator */ | ||
| MPI_Comm_get_parent( &parentcomm ); | ||
|
|
||
| /* write output according to which communicator this process is a part of */ | ||
| if (parentcomm == MPI_COMM_NULL) { | ||
| /* Create 2 more processes. | ||
| ** Here we spawn 2 more instances of this program. | ||
| ** argv[0] contains the name of the executable for this program. */ | ||
| char * spawn_args[] = {"-n", "1", NULL}; | ||
| MPI_Comm_spawn( argv[0], spawn_args, np, MPI_INFO_NULL, 0, | ||
| MPI_COMM_WORLD, &spawnedcomm, MPI_ERRCODES_IGNORE ); | ||
| /* get the process rank, in this case within the parent communicator */ | ||
| MPI_Comm_rank(MPI_COMM_WORLD,&rank); | ||
| MPI_Comm_size(MPI_COMM_WORLD,&size); | ||
| printf("[%ld] rank %d (of %d) in the parent intra-communicator.\n", (long)pid, rank, size); | ||
| } | ||
| else { | ||
| /* notice that the spawned processes have an intra-communicator | ||
| ** called MPI_COMM_WORLD, too */ | ||
| MPI_Comm_rank(MPI_COMM_WORLD,&rank); | ||
| MPI_Comm_size(MPI_COMM_WORLD,&size); | ||
| printf("[%ld] rank %d (of %d) in the spawned intra-communicator.\n", (long)pid, rank, size); | ||
| } | ||
|
|
||
| /* we can broadcast to all processes associated with an | ||
| ** inter-communicator, e.g. the spawned processes */ | ||
| if (rank == MASTER) { | ||
| message[0] = 'g'; message[1] = 'a'; message[2] = 'l'; message[3] = 'o'; | ||
| message[4] = 'r'; message[5] = 'e'; message[6] = '!'; message[7] = '\0'; | ||
| } | ||
| /* BUT remember that broadcast is a collective operation, so all must call.. | ||
| ** but it's a tad fiddly with all the different groups of processors that | ||
| ** we have. | ||
| ** Note also that the inter-communicator has different names | ||
| ** according to the (parent/spawned) perspective. */ | ||
| if (parentcomm == MPI_COMM_NULL) { | ||
| if (rank == MASTER) { | ||
| MPI_Bcast(message,BUFSIZE,MPI_CHAR,MPI_ROOT,spawnedcomm); | ||
| } | ||
| MPI_Bcast(message,BUFSIZE,MPI_CHAR,MPI_PROC_NULL,spawnedcomm); | ||
| } | ||
| else { | ||
| MPI_Bcast(message,BUFSIZE,MPI_CHAR,MASTER,parentcomm); | ||
| printf("[%ld] spawned rank %d (of %d). Master broadcasts: %s\n", (long)pid, rank, size, message); | ||
| } | ||
|
|
||
| /* A simpler manoeuvre is to (collectively) merge | ||
| ** the processes associated with an inter-communicator: */ | ||
| if (parentcomm == MPI_COMM_NULL) { | ||
| MPI_Intercomm_merge(spawnedcomm, 0, &allcomm); | ||
| } | ||
| else { | ||
| MPI_Intercomm_merge(parentcomm, 0, &allcomm); | ||
| } | ||
|
|
||
| /* all processes can make calls associated with the | ||
| ** merged communicator */ | ||
| MPI_Comm_rank(allcomm,&rank); | ||
| MPI_Comm_size(allcomm,&size); | ||
| printf("[%ld] rank %d (of %d) in the merged intra-communicator.\n", (long)pid, rank, size); | ||
|
|
||
| /* free communicators when we've finished with them | ||
| ** remembering the different names as seen from different | ||
| ** perspectives */ | ||
| if (parentcomm == MPI_COMM_NULL) { | ||
| MPI_Comm_free(&spawnedcomm); | ||
| MPI_Comm_free(&allcomm); | ||
| } | ||
| else { | ||
| MPI_Comm_free(&parentcomm); | ||
| MPI_Comm_free(&allcomm); | ||
| } | ||
|
|
||
| /* and finalise */ | ||
| fflush(stdout); | ||
| MPI_Finalize(); | ||
| return 0; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,23 @@ | ||
| #!/usr/bin/env python | ||
| #Program written by Devin Shende on August 5th 2018 | ||
|
|
||
| def firstPrimeAfter(x): | ||
| import math | ||
| current = x + 1 | ||
| sqrtno = math.sqrt(current) | ||
| while True: | ||
| #search for primes starting at x until it finds one | ||
| #break once found a prime | ||
| for potentialfactor in range(2,current): | ||
| # start at 2 because 1 will always be a factor | ||
| # go all the way up to the sqrt of current looking for a factor | ||
| if current % potentialfactor == 0: | ||
| # Found factor. not prime | ||
| break # move on to next number | ||
| elif potentialfactor >= sqrtno: | ||
| print("The first prime number after {} is {}".format(x,current)) | ||
| return current | ||
| current += 1 | ||
|
|
||
| firstPrimeAfter(10000000) | ||
|
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.