Kipu – Lightweight threads for Java
DOI:
https://doi.org/10.26439/interfases2014.n007.143Keywords:
concurrency, heap, Java, thread, taskAbstract
This paper describes a cooperative thread scheduling mechanism, which can be used effectively on real-time java virtual machines. This scheduler is implemented using a heap-based priority queue which allows for O(log N) processing time. Since this scheduler is strictly cooperative, thread coordination is performed without the requirement of formal java thread synchronization. Though similar outcomes can be achieved through program design, this abstraction allows developers to focus on their application.
Downloads
References
Labrosse, J. (1992). MicroC/OS The real-time kernel. Kansas, USA: R&D Publications.
Main, M. (2002). Data structures and other objects using java (2da ed.). Boston, USA: Addison-Wesley Longman.
Venners, B. (1999). Inside the Java 2.0 Virtual Machine (2da ed.). New York, USA: McGraw-Hill.
Downloads
Published
Issue
Section
License
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under an Attribution 4.0 International (CC BY 4.0) License. that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Last updated 03/05/21
