{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:28:08Z","timestamp":1738387688145,"version":"3.35.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. of Compt. Sci. & Technol."],"published-print":{"date-parts":[[1994,4]]},"DOI":"10.1007\/bf02939494","type":"journal-article","created":{"date-parts":[[2008,9,3]],"date-time":"2008-09-03T04:53:11Z","timestamp":1220417591000},"page":"128-143","source":"Crossref","is-referenced-by-count":1,"title":["Using timed Petri net to model instruction-level loop scheduling with resource constraints"],"prefix":"10.1007","volume":"9","author":[{"given":"Jian","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Eisenbeis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Su","family":"Bogong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02939494_CR1","doi-asserted-by":"crossref","unstructured":"A Aiken, A Nicolau. Perfect pipelining: A new loop parallelization technique. Research Report 87-873, Dept. of Computer Science, Cornell Univ., 1987.","DOI":"10.1007\/3-540-19027-9_15"},{"key":"BF02939494_CR2","unstructured":"G S Almasi, A Gottlieb. Highly Pparallel Computing. The Benjamin\/Cummings Publishing Company, Inc., 1989."},{"key":"BF02939494_CR3","doi-asserted-by":"crossref","unstructured":"F Bodinet al. Overview of a high-performance programmable pipeline architecture In: Proc. of ACM International Conference on Supercomputing, Crete, 1989.","DOI":"10.1145\/318789.318868"},{"key":"BF02939494_CR4","doi-asserted-by":"crossref","unstructured":"D G Bradleeet al. Integrating register allocation and instruction scheduling for RISCs. In: Proc Intl Conf ASPLOS, April 1991.","DOI":"10.1145\/106972.106986"},{"key":"BF02939494_CR5","doi-asserted-by":"crossref","unstructured":"J Carlieret al. Modelling scheduling problems with timed Petri nets. In: Advances in Petri Nets 1984.","DOI":"10.1007\/3-540-15204-0_5"},{"key":"BF02939494_CR6","doi-asserted-by":"crossref","unstructured":"J Carlieret al. Timed Petri net schedules. In: Advances in Petri Nets 1988.","DOI":"10.1007\/3-540-50580-6_24"},{"key":"BF02939494_CR7","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/C-M.1981.220595","volume":"9","author":"A E Charlesworth","year":"1981","unstructured":"A E Charlesworth. An approach to scientific array processing: The architecture design of the AP-120B\/FPS-164 family.Computer, 1981, 9: 18\u201327.","journal-title":"Computer"},{"key":"BF02939494_CR8","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0022-0000(71)80013-2","volume":"5","author":"F Commoner","year":"1971","unstructured":"F Commoner, A W Holt Marked directed graphs.Journal of Computer and System Sciences, 1971, 5:511\u2013523.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02939494_CR9","doi-asserted-by":"crossref","unstructured":"C Eisenbeis. Optimization of horizontal microcode generation for loop structures. In: Proc of ACM International Conference on Supercomputing, Saint-Malo, France, 1988.","DOI":"10.1145\/55364.55408"},{"key":"BF02939494_CR10","unstructured":"C Eisenbeiset al. Compile-time optimization of memory usage on the CRAY-2. In: Proc. NATO Supercomputer Workshop, Trondheim, Norway, 1989."},{"key":"BF02939494_CR11","doi-asserted-by":"crossref","unstructured":"G R Gaoet al. A time Petri-net model for fine-grain loop scheduling. In: Proc of ACM SIGPLAN'91 Conference on PLDI, June, 1991.","DOI":"10.1145\/113445.113463"},{"key":"BF02939494_CR12","unstructured":"Q Ning, G R Gao. Optimal memory allocation for argument fetching dataflow machines. ACAPS Technical Memo 32, Mac Gill University, Montreal, Canada."},{"key":"BF02939494_CR13","unstructured":"C Hanen. Problemes D'Ordonnancement des architectures pipelines: Modelisation, optimisation, algorithmes. These de Doctorat de L'Universite Paris 6, 1987."},{"key":"BF02939494_CR14","unstructured":"C Hanen. Study of a NP-hard cyclic scheduling problem: The periodic recurrent job-shop. Research Rapport, Laboratoire MASI, Universite P. et M. Curie, 1991."},{"key":"BF02939494_CR15","unstructured":"M S Lam. Software pipelining: An effective scheduling technique for VLIW machine. In: Proc. SIGPLAN'88 Conference on PLDI, Atlanta, June, 1988."},{"key":"BF02939494_CR16","volume-title":"Petri Net Theory and the Modeling of Systems","author":"J L Peterson","year":"1981","unstructured":"J L Peterson, Petri Net Theory and the Modeling of Systems. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1981."},{"key":"BF02939494_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W Reisig","year":"1985","unstructured":"W Reisig. Petri Nets: An Introduction. Springer-Verlag, Berlin Heidelberg, 1985."},{"key":"BF02939494_CR18","unstructured":"Bogong Su, Jian Wang. Loop-carried dependence and the general URPR software pipelining approach. Proc. 24th HAWAII International Conference on System Sciences, Kailua-Kona, Hawaii, Jan. 1991."},{"key":"BF02939494_CR19","doi-asserted-by":"crossref","unstructured":"R F Touzeau. A Fortran compiler for the FPS-164 scientific computer. In Proc ACM SIGPLAN Symposium on Compiler Construction, 1984.","DOI":"10.1145\/502874.502879"},{"key":"BF02939494_CR20","unstructured":"Jian Wang, Christine Eisenbeis. A new timed Petri net model for loop scheduling with resource constraints. INRIA Research Report, No. 1810, Dec. 1992."},{"key":"BF02939494_CR21","unstructured":"Jian Wang, Christine Eisenbeis, Philippe Canalda. Using time Petri net to analyze the maximum computation rate for loop programs. In: Proc of 3rd International Conference for Young Computer Scientists, Beijing, China, 1993."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02939494.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02939494\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02939494","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T20:05:37Z","timestamp":1738353937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02939494"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["BF02939494"],"URL":"https:\/\/doi.org\/10.1007\/bf02939494","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}