Click here to Skip to main content
14,773,203 members
Articles » General Programming » Parallel Programming » General » Revisions

Tagged as

Stats

1.2K views
16 downloads
2 bookmarked

Queue-like Data Structure for Hierarchy-based Scheduling

Rate me:
Please Sign up or sign in to vote.
5.00/5 (1 vote)
25 Nov 2020CPOL
Data structure that allows items to be scheduled for processing based on the tags that define item hierarchy
The goal of forque data structure is to allow items to be scheduled for processing based on hierarchical tags attached to them. Forque ensures that at most one item is processed at a given time for all tags related to the item’s own tag, while respecting relative order among related items in which they have been reserved in the queue.

Revisions


  

Compare Revision Minor Date Status Editor
6 - publicly available Yes 27-Nov-20 3:50 Available Deeksha Shenoy
Updates in content. Changes: 85
3 No 25-Nov-20 14:36 Available Mladen Janković
Updates in content. Changes: 12052
2 No 25-Nov-20 14:35 Available Mladen Janković
Updates in content. Changes: 12203

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Author

Mladen Janković
Software Developer
Serbia Serbia
No Biography provided

Comments and Discussions