{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:54:05Z","timestamp":1725890045088},"publisher-location":"Dordrecht","reference-count":19,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789048141944"},{"type":"electronic","value":"9789401579759"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-94-015-7975-9_25","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T17:21:53Z","timestamp":1358788913000},"page":"401-418","source":"Crossref","is-referenced-by-count":0,"title":["Rough Grammar for High Performance Management of Processes on a Distributed System"],"prefix":"10.1007","author":[{"given":"Zbigniew M.","family":"W\u00f3jcik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara E.","family":"W\u00f3jcik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","first-page":"62","volume-title":"\u201calgorithms for End-to-End Scheduling to Meet Deadlines\u201d, Proc. 2nd Ieee Symp. on Parallel and Distributed Processing","author":"R Bettati","year":"1990","unstructured":"R. Bettati, J.W. Liu, \u201cAlgorithms for End-to-End Scheduling to Meet Deadlines\u201d, Proc. 2nd IEEE Symp. on Parallel and Distributed Processing, Dallas, Texas, Dec. 1990, pp 62\u201367."},{"key":"25_CR2","first-page":"402","volume-title":"\u201cscheduling Precedence Graphs to Minimize Total System Time in Partitionable Parallel Architectures\u201d, Proc. 2nd Ieee Symp. on Parallel and Distributed Processing","author":"HA Choi","year":"1990","unstructured":"H.A. Choi, B. Narahari, \u201cScheduling Precedence Graphs to Minimize Total System Time in Partitionable Parallel Architectures\u201d, Proc. 2nd IEEE Symp. on Parallel and Distributed Processing, Dallas, Texas, Dec. 1990, pp 402\u2013406."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"D.I.A. Cohen, Introduction to Computer Theory, Wiley, 1988.","DOI":"10.1007\/978-1-349-18967-0_1"},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"EW Dijkstra","year":"1980","unstructured":"E.W. Dijkstra, C.S. Scholten, \u201cTermination detection for Diffusing Computation\u201d, Inf. Process. Letters, 11, 1, Aug. 1980, pp 1\u20134.","journal-title":"Inf. Process. Letters"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1109\/T-C.1972.223502","volume":"12","author":"MJ Gonzalez","year":"1972","unstructured":"M.J. Gonzalez, C.V. Ramamoorthy, \u201cParallel Process Execution in a Decentralized System\u201d, IEEE Trans. C.mp., vol.c-21, No. 12, 1972, pp 1310\u20131322.","journal-title":"Ieee Trans. C.mp., vol.c-21"},{"key":"25_CR6","unstructured":"J.Ji, K. Jeng, \u201cBin Packing Adjustable Rectangles and Applications to Task Scheduling on Partitionable Parallel Computers\u201d, Proc. 2nd IEEE Symp. on Parallel and Distributed Processing, Dallas, Texas, Dec. 1990, pp 312\u2013315."},{"key":"25_CR7","first-page":"155","volume-title":"Hypercube Multiprocessors","author":"ML Mathews","year":"1986","unstructured":"M.L. Mathews, \u201cHypercube software performance metrics\u201d, in: Hypercube Multiprocessors, ed. M. T. Heath, SIAM, 1986, pp 155\u2013160."},{"key":"25_CR8","unstructured":"M. Minsky, S. Papert, \u201cOn some Associative Parallel and Analog Computations\u201d, in: Associative Information Techniques, E.J.Jacks, ed., American Elsevier, 1971."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0020-7373(84)80022-X","volume":"20","author":"Z Pawlak","year":"1984","unstructured":"Z. Pawlak, \u201cRough Classification\u201d, International Journal of Man-Machine Studies, 20, 1984, pp 469\u2013483.","journal-title":"International Journal of Man-Machine Studies"},{"key":"25_CR10","unstructured":"C.V. Ramamoorthy, M. J. Gonzalez, \u201cA survey techniques for recognizing parallel processable streams in computer programs\u201d, in: 1969 Fall Joint Comput. Conf., AFIPS Conf. Proc.,v.35, Montvale, N.J.: AFIPS Press, 1969, ppl-17."},{"key":"25_CR11","first-page":"42","volume-title":"\u201cdynamic-level Scheduling for Heterogeneous Processor Networks\u201d, Proc. 2nd Ieee Symp. on Parallel and Distributed Processing","author":"GC Sih","year":"1990","unstructured":"G.C. Sih, E.A. Lee, \u201cDynamic-Level Scheduling for Heterogeneous Processor Networks\u201d, Proc. 2nd IEEE Symp. on Parallel and Distributed Processing, Dallas, Texas, Dec. 1990, pp 42\u201349."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"H. Sulivan, T.R. Bashkov, \u201cA large scale homogeneous, fully distributed parallel machine, I\u201d, Proc. Fourth Symp. on Comput. Arch., March 1977, pp 105\u2013117.","DOI":"10.1145\/633615.810659"},{"key":"25_CR13","first-page":"108","volume-title":"Hypercube Multiprocessors","author":"WI Williams","year":"1987","unstructured":"W.I. Williams, \u201cLoad Balancing and Hypercubes: a preliminary look\u201d, in: Hypercube Multiprocessors 1987, eds. M.T. Heath, SIAM, Philadelphia, 1987, pp 108\u2013113."},{"key":"25_CR14","first-page":"228","volume":"40","author":"ZM Wojcik","year":"1987","unstructured":"Z.M. Wojcik, \u201cRough Approximation of Shapes in Pattern Recognition\u201d, CVGIP, 40, 228\u2013249, 1987.","journal-title":"Cvgip"},{"key":"25_CR15","first-page":"84","volume-title":"\u201cthe Rough Grammar for the Parallel Shape Coding\u201d, Proc. Acm South Central Regional Conference","author":"ZM Wojcik","year":"1989","unstructured":"Z.M. Wojcik, \u201cThe Rough Grammar for the Parallel Shape Coding\u201d, Proc. ACM South Central Regional Conference, Tulsa, Nov. 1989, pp 84\u201390."},{"issue":"12","key":"25_CR16","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1109\/32.58770","volume":"15","author":"BE Wojcik","year":"1989","unstructured":"B.E. Wojcik, Z.M. Wojcik, \u201cSufficient Condition for a Communication Deadlock and Distributed Deadlock Detection\u201d, IEEE Trans. on Software Eng., vol. 15, no. 12, Dec. 1989, pp 1587\u20131595.","journal-title":"Ieee Trans. on Software Eng."},{"key":"25_CR17","first-page":"212","volume-title":"\u201cfault Tolerant Distributed Computing Using Atomic Send-Receive Checkpoints\u201d, Proc. 2nd Ieee Symp. on Parallel and Distributed Processing","author":"ZM Wojcik","year":"1990","unstructured":"Z.M. Wojcik, B.E. Wojcik, \u201cFault Tolerant Distributed Computing Using Atomic Send-Receive Checkpoints\u201d, Proc. 2nd IEEE Symp. on Parallel and Distributed Processing, Dallas, Texas, Dec. 1990, pp 212\u2013222."},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0165-1684(90)90035-W","volume":"19","author":"ZM Wojcik","year":"1990","unstructured":"Z.M. Wojcik, B.E. Wojcik, \u201cA Rough Grammar for a Linguistic Recognition of Image Patches\u201d, Signal Processing, 19, 1990, pp 119\u2013138.","journal-title":"Signal Processing"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Z.M. Wojcik, \u201cRough Grammar for Efficient and Fault Tolerant Computing on a Distributed System\u201d, IEEE Trans. Software Engineering,,July 1991.","DOI":"10.1109\/32.83902"}],"container-title":["Intelligent Decision Support"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-94-015-7975-9_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,6]],"date-time":"2022-02-06T11:01:51Z","timestamp":1644145311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-94-015-7975-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9789048141944","9789401579759"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-94-015-7975-9_25","relation":{},"subject":[],"published":{"date-parts":[[1992]]}}}