By multithread applications: Difference between revisions
Created page with "Title: by multithread applications Authors: Abstract: The study of distributed computing algorithms by multithread applications Ahmet A. Husainov Keywords: Asynchronous programming, Petri nets, concurre ncy Main Research Question: How can recursive programs be converted into multithread applications? Methodology: The authors present a method to convert recursive programs into multithread applications. They demonstrate this method using a Hoare quick sort example. R..." |
No edit summary |
||
Line 1: | Line 1: | ||
Title: by multithread applications | Title: by multithread applications | ||
Authors: | Authors: | ||
Abstract: | Abstract: | ||
Line 8: | Line 8: | ||
Ahmet A. Husainov | Ahmet A. Husainov | ||
Keywords: Asynchronous programming, Petri nets, | Keywords: Asynchronous programming, Petri nets, concurren cy | ||
Main Research Question: How can recursive programs be converted into multithread applications? | Main Research Question: How can recursive programs be converted into multithread applications? | ||
Line 16: | Line 16: | ||
Results: | Results: | ||
The conversion | The conversion of the recursive Hoare quick sort function into a multithread application. | ||
Implications: | Implications: | ||
The | The ability to convert recursive programs into multithread applications can lead to more efficient and parallelizable code. This can be particularly useful in distributed computing. | ||
Conclusion: | |||
In conclusion, the authors have presented a method to convert recursive programs into multithread applications. This can lead to more efficient and parallelizable code, which is particularly useful in distributed computing. | |||
Link to Article: https://arxiv.org/abs/ | Link to Article: https://arxiv.org/abs/0404015v2 | ||
Authors: | Authors: | ||
arXiv ID: | arXiv ID: 0404015v2 | ||
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
[[Category:Multithread]] | [[Category:Multithread]] | ||
[[Category:Applications]] | [[Category:Applications]] | ||
[[Category: | [[Category:Recursive]] | ||
[[Category: | [[Category:Into]] | ||
[[Category:Can]] |
Latest revision as of 15:43, 24 December 2023
Title: by multithread applications
Authors:
Abstract: The study of distributed computing algorithms by multithread applications Ahmet A. Husainov
Keywords: Asynchronous programming, Petri nets, concurren cy
Main Research Question: How can recursive programs be converted into multithread applications?
Methodology: The authors present a method to convert recursive programs into multithread applications. They demonstrate this method using a Hoare quick sort example.
Results: The conversion of the recursive Hoare quick sort function into a multithread application.
Implications: The ability to convert recursive programs into multithread applications can lead to more efficient and parallelizable code. This can be particularly useful in distributed computing.
Conclusion: In conclusion, the authors have presented a method to convert recursive programs into multithread applications. This can lead to more efficient and parallelizable code, which is particularly useful in distributed computing.
Link to Article: https://arxiv.org/abs/0404015v2 Authors: arXiv ID: 0404015v2