Optimal Implementation of Two FIFO-Queues in Single-Level Memory
ABSTRACT
This paper presents mathematical models and optimal algorithms of two FIFO-queues control in single-level memory. These models are designed as two-dimensional random walks on the integer lattice in a rectangular area for consecutive implementation and a triangle area for linked list implementation.

Cite this paper
nullE. Aksenova and A. Sokolov, "Optimal Implementation of Two FIFO-Queues in Single-Level Memory," Applied Mathematics, Vol. 2 No. 10, 2011, pp. 1297-1302. doi: 10.4236/am.2011.210180.
References
   D. E. Knuth, “The Art of Computer Programming,” Vol. 1, Addison-Wesley, Reading, 2001.

   A. V. Sokolov, “About Storage Allocation for Implementing Two Stacks,” Automation of Experiment and Data Processing, Petrozavodsk, 1980, pp. 65-71 (in Russian).

   A. C. Yao, “An Analysis of a Memory Allocation Scheme for Implementation of Stacks,” SIAM Journal on Computing, Vol. 10, 1981, pp. 398-403. doi:10.1137/0210029

   P. Flajolet, “The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle,” Lecture Notes in Computer Science, Vol. 233, 1986, pp. 325-340. doi:10.1007/BFb0016257

   G. Louchard, R. Schott, M. Tolley and P. Zimmermann, “Random Walks, Heat Equation and Distributed Algorithms,” Journal of Com-putational and Applied Mathema- tics, Vol. 53, No. 2. 1994, pp. 243-274. doi:10.1016/0377-0427(94)90048-5

   R. S. Maier, “Colliding Stacks: A Large Deviations Analysis,” Random Structures and Algorithms, Vol. 2, No. 4, 1991, pp. 379-421. doi:10.1002/rsa.3240020404

   E. A. Akse-nova, A. A. Lazutina and A. V. Sokolov, “Study of a Non-Markovian Stack Management Model in a Two-Level Memory,” Programming and Computer Software, Vol. 30, No. 1, 2004, pp. 25-33. doi:10.1023/B:PACS.0000013438.25368.b4

   E. A. Aksenova and A. V. Sokolov, “Optimal Management of Two Parallel Stacks in Two-Level Memory,” Discrete Mathematics and Applications, Vol. 17, No. 1, 2007, pp. 47-56. doi:10.1515/DMA.2007.006

   E. A. Aksenova, A. V. Sokolov and A. V. Tarasuk, “About Optimal Allo-cation of Two FIFO-Queues in the Bounded Area of Memory,” Control Systems and Information Technologies, Vol. 3, No. 22, 2006, pp. 62-68 (in Russian).

   J. G. Kemeny and J. L. Snell, “Finite Markov Chains, Van Nostrand,” Princeton, New Jersey, 1960.

Top
{"ft_lang_label":"__label__en","ft_lang_prob":0.68150014,"math_prob":0.5237843,"size":2281,"snap":"2019-43-2019-47","text_gpt3_token_len":760,"char_repetition_ratio":0.112428635,"word_repetition_ratio":0.0,"special_character_ratio":0.35686103,"punctuation_ratio":0.29508197,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9517189,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-20T18:13:52Z\",\"WARC-Record-ID\":\"<urn:uuid:f392196f-7230-40f7-8f9a-cdd3322855a8>\",\"Content-Length\":\"28707\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c3881aa8-71d6-4769-9315-9dc885177d0e>\",\"WARC-Concurrent-To\":\"<urn:uuid:5d99044c-ac4e-47d6-b050-0a2b0a4e31f8>\",\"WARC-IP-Address\":\"173.208.146.83\",\"WARC-Target-URI\":\"https://m.scirp.org/papers/7854\",\"WARC-Payload-Digest\":\"sha1:GHMZFQVJVDUSRXGGA5IMF2GHHYW5FVBR\",\"WARC-Block-Digest\":\"sha1:M7ZJ23TTHUYYUHVAGQZG7V6RHCDCYBWU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570986717235.56_warc_CC-MAIN-20191020160500-20191020184000-00533.warc.gz\"}"}