ACM Home Page
Please provide us with feedback. Feedback
Software synthesis through task decomposition by dependency analysis
Full text Publisher SitePublisher Site PdfPdf (315 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California, United States
Pages: 98 - 104  
Year of Publication: 1997
ISBN:0-8186-7597-7
Authors
Youngsoo Shin  School of Electrical Engineering, Seoul National University, Seoul, Korea, 151-742
Kiyoung Choi  School of Electrical Engineering, Seoul National University, Seoul, Korea, 151-742
Sponsors
IEEE-CS : Computer Society
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 9,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Latency tolerance is one of main problems of software synthesis in the design of hardware-software mixed systems. This paper presents a methodology for speeding up systems through latency tolerance which is obtained by decomposition of tasks and generation of an efficient scheduler. The task decomposition process focuses on the dependency analysis of system i/o operations. Scheduling of the decomposed tasks is performed in a mixed static and dynamic fashion. Experimental results show the significance of our approach.




Collaborative Colleagues:
Youngsoo Shin: colleagues
Kiyoung Choi: colleagues