Loading...
Please wait, while we are loading the content...
Similar Documents
Deriving Eecient Divide & Conquer Algorithms from Sequential Speciication
| Content Provider | Semantic Scholar |
|---|---|
| Author | Chin, Norman |
| Abstract | We propose an inductive method to synthesize parallel divide-and-conquer programs from sequential recursive functions. Traditionally, such parallelization methods are based on schematic rules which attempt to match each given sequential program to a prescribed set of program schemes that have parallel counterparts. Instead of relying on specialized program schemes, we propose a new approach to parallelization based on elementary transformation rules. Our approach requires an induction to recover parallellism from sequential programs. To achieve this, we apply a second-order generalisation step to selected instances of sequential equations , before an inductive derivation procedure. The new approach is systematic enough to be semi-automated, and shall be shown to be widely applicable using a range of examples. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.iis.sinica.edu.tw/~trc/chinwn.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
