Functions Palette/Programming/Synchronization/Queue Operations - Revision history

Q: Added palette items

2020-06-22T19:53:02Z

Added palette items

@@ Line 1: / Line 1: @@
-==Location in palette==
+{{LabVIEW Palette
-Functions >> Synchronization >> Queue Operations
+|image  =  QueuePalette.png
-[[File:QueuePalette.png|thumb|Queue Operations Palette]]
+|title  = Queue Operations palette
 ==Concept==
 (From [http://www.ni.com NI.com])
@@ Line 15: / Line 76: @@
 #[https://knowledge.ni.com/KnowledgeArticleDetails?id=kA00Z000000P7OfSAK&l=en-US NI.com - What Is a Queue]
-[[Category:Synchronization]]
+[[Category:Queue Operations Palette]]

Logmanoriginal: Logmanoriginal moved page Queue to Functions Palette/Programming/Synchronization/Queue Operations over redirect: Original Move was correct

2019-07-23T17:32:04Z

Logmanoriginal moved page Queue to Functions Palette/Programming/Synchronization/Queue Operations over redirect: Original Move was correct

← Older revision	Revision as of 17:32, 23 July 2019
(No difference)

Logmanoriginal: Logmanoriginal moved page Functions Palette/Programming/Synchronization/Queue Operations to Queue over redirect: Doesn't belong on the Programming Palette

2019-07-23T17:30:18Z

Logmanoriginal moved page Functions Palette/Programming/Synchronization/Queue Operations to Queue over redirect: Doesn't belong on the Programming Palette

← Older revision	Revision as of 17:30, 23 July 2019
(No difference)

Logmanoriginal: Logmanoriginal moved page Queue to Functions Palette/Programming/Synchronization/Queue Operations: This page explains the Queue Operations Palette

2019-07-23T17:14:28Z

Logmanoriginal moved page Queue to Functions Palette/Programming/Synchronization/Queue Operations: This page explains the Queue Operations Palette

← Older revision	Revision as of 17:14, 23 July 2019
(No difference)

Bryan: Main part was taken from NI.com. Added image and additional text from/link to NI.com knowledge base article on queues from which the original wording came.

2019-02-21T17:33:59Z

Main part was taken from NI.com. Added image and additional text from/link to NI.com knowledge base article on queues from which the original wording came.

← Older revision		Revision as of 17:33, 21 February 2019
Line 1:		Line 1:
	==Location in palette==		==Location in palette==
			Functions >> Synchronization >> Queue Operations
			[[File:QueuePalette.png\|thumb\|Queue Operations Palette]]
	==Concept==		==Concept==
	A queue maintains a first in/first out order of data items. For instance, the customers waiting in line at a fast food restaurant are in a queue. A queue is useful in producer/consumer situations, where one portion of code is creating data to be used by another portion. The advantage of using a queue is that the producer and consumer rates do not have to be identical. If consumption is slower than production, the queue will become full and the producer code will be forced to wait until the consumer has dequeued an element before a new element can be queued up.		(From [http://www.ni.com NI.com])

			A queue maintains a first in/first out (FIFO) order of data items. For instance, the customers waiting in line at a fast food restaurant are in a queue.

			A queue is useful in producer/consumer situations, where one portion of code is creating data to be used by another portion. The advantage of using a queue is that the producer and consumer rates do not have to be identical. If consumption is slower than production, the queue will become full and the producer code will be forced to wait until the consumer has dequeued an element before a new element can be queued up.

			Unlike an array, it is not possible to randomly access elements in a queue. It is strictly a buffer that provides you the ability to enqueue (add/insert) and dequeue (subtract/remove) elements. The only way to view all the elements in a queue is to dequeue them one by one. You cannot perform data manipulation to all the elements in a queue either.
	==Example use cases==		==Example use cases==
			[[Queued_State_Machine\|Queued State Machines]] (Also known as Queue Driven State Machines, or QDSMs).
			==External Links==
			#[https://knowledge.ni.com/KnowledgeArticleDetails?id=kA00Z000000P7OfSAK&l=en-US NI.com - What Is a Queue]

	[[~~category~~:~~synchronization~~]]		[[Category:Synchronization]]
			[[Category:Synchronization]]

Michael_Aivaliotis at 09:47, 1 October 2007

2007-10-01T09:47:39Z

← Older revision		Revision as of 09:47, 1 October 2007
Line 3:		Line 3:
	A queue maintains a first in/first out order of data items. For instance, the customers waiting in line at a fast food restaurant are in a queue. A queue is useful in producer/consumer situations, where one portion of code is creating data to be used by another portion. The advantage of using a queue is that the producer and consumer rates do not have to be identical. If consumption is slower than production, the queue will become full and the producer code will be forced to wait until the consumer has dequeued an element before a new element can be queued up.		A queue maintains a first in/first out order of data items. For instance, the customers waiting in line at a fast food restaurant are in a queue. A queue is useful in producer/consumer situations, where one portion of code is creating data to be used by another portion. The advantage of using a queue is that the producer and consumer rates do not have to be identical. If consumption is slower than production, the queue will become full and the producer code will be forced to wait until the consumer has dequeued an element before a new element can be queued up.
	==Example use cases==		==Example use cases==

			[[category:synchronization]]

MichaelAivaliotis: New page: ==Location in palette== ==Concept== A queue maintains a first in/first out order of data items. For instance, the customers waiting in line at a fast food restaurant are in a queue. A queu...

2007-09-20T16:36:30Z

New page: ==Location in palette== ==Concept== A queue maintains a first in/first out order of data items. For instance, the customers waiting in line at a fast food restaurant are in a queue. A queu...

New page

==Location in palette==
==Concept==
A queue maintains a first in/first out order of data items. For instance, the customers waiting in line at a fast food restaurant are in a queue. A queue is useful in producer/consumer situations, where one portion of code is creating data to be used by another portion. The advantage of using a queue is that the producer and consumer rates do not have to be identical. If consumption is slower than production, the queue will become full and the producer code will be forced to wait until the consumer has dequeued an element before a new element can be queued up.
==Example use cases==