Proceedings of the 1985 ACM Thirteenth Annual Conference on Computer Science - CSC '85 1985
DOI: 10.1145/320599.322491
|View full text |Cite
|
Sign up to set email alerts
|

Development of a parallel algorithmic language (abstract only)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 0 publications
0
0
0
Order By: Relevance
“…The DEAP library allows simultaneous evaluation of subjects, however, in our case the sequential execution of the genetic algorithm proved to be less time-consuming, due to the communication overhead between different processes. Communication overhead is especially prominent in Python since the global interpreter lock (GIL) prevents parallel execution of multiple threads [65]. SAILoR required on average approximately 7 minutes and 41 seconds to infer a Boolean network with 64 nodes on 32 allocated AMD EPYC 7453 CPU cores.…”
Section: Plos Onementioning
confidence: 99%
“…The DEAP library allows simultaneous evaluation of subjects, however, in our case the sequential execution of the genetic algorithm proved to be less time-consuming, due to the communication overhead between different processes. Communication overhead is especially prominent in Python since the global interpreter lock (GIL) prevents parallel execution of multiple threads [65]. SAILoR required on average approximately 7 minutes and 41 seconds to infer a Boolean network with 64 nodes on 32 allocated AMD EPYC 7453 CPU cores.…”
Section: Plos Onementioning
confidence: 99%