完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Wu, Shiow-Yang | |
| dc.date.accessioned | 2009-08-23T04:38:48Z | |
| dc.date.accessioned | 2020-05-25T06:28:18Z | - |
| dc.date.available | 2009-08-23T04:38:48Z | |
| dc.date.available | 2020-05-25T06:28:18Z | - |
| dc.date.issued | 2006-10-25T01:10:08Z | |
| dc.date.submitted | 1996-12-19 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/2429 | - |
| dc.description.abstract | Decomposition abstraction is the process of organizing and specifying decomposition strategies for the exploitation of parallelism available in an application. In a recent paper [14], we have developed and evaluated declarative primitives for rule-based programs that expand opportunities for parallel execution. In this paper, we discuss the programming of parallel rule-based systems using decomposition abstraction primitives. We propose methodologies for transforming sequential rule programs into parallel programs and for programming parallel systems from scratch. Preliminary implementation and experimentation results demonstrate scalable and broadly available parallelism. | |
| dc.description.sponsorship | 中山大學,高雄市 | |
| dc.format.extent | 8p. | |
| dc.format.extent | 658335 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 1996 ICS會議 | |
| dc.subject.other | Knowledge Acquisition, Representation & Inference | |
| dc.title | Parallel Programming of Rule-Based Systems with Decomposition Abstraction | |
| 分類: | 1996年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics001996000090.pdf | 642.91 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。