By multithread applications: Difference between revisions

From Simple Sci Wiki
Jump to navigation Jump to search
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, concurre ncy
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 process involves defining a structure for argument passing, replacing function calls with thread creations, and modifying the main program to handle multiple threads.
The conversion of the recursive Hoare quick sort function into a multithread application.


Implications:
Implications:
The technique presented in this research can be applied to other recursive programs to create multithread applications. This can lead to improved performance and better utilization of system resources.
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.
 
Additional Information:
The authors also discuss the implementation of a pairing algorithm and the building of wave systems by Petri nets and object-oriented programming.
 
Related Research:
For more information on distributed computing and multithreading, see the following related research:
 
1. Distributed Computing in Practice by Ian Foster and Katherine Yvonne Staley
2. Concurrency: Theory and Practice by Thomas A. Lee
3. Multithreaded Programming with Pthreads by Brian W. Kernighan and Robert S. Martin


Please note that the title of this wiki entry should be the exact article title: by multithread applications
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/0404015v1
Link to Article: https://arxiv.org/abs/0404015v2
Authors:  
Authors:  
arXiv ID: 0404015v1
arXiv ID: 0404015v2


[[Category:Computer Science]]
[[Category:Computer Science]]
[[Category:By]]
[[Category:Multithread]]
[[Category:Multithread]]
[[Category:Applications]]
[[Category:Applications]]
[[Category:Research]]
[[Category:Recursive]]
[[Category:This]]
[[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