1998
DOI: 10.1016/s0096-0551(97)00007-6
|View full text |Cite
|
Sign up to set email alerts
|

SequenceL provides a different way to view programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

1999
1999
2009
2009

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 15 publications
(28 citation statements)
references
References 11 publications
0
28
0
Order By: Relevance
“…The early work concerning the classes of iterative problem solutions, led to a 15 year effort leading to SequenceL [Cooke 1996[Cooke , 1998]. In addition to automatically deriving many iterative and recursive algorithms to traverse data structures, we have also investigated the use of SequenceL to automatically discover and evaluate parallelizable subtasks [Cooke and Andersen 2000].…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…The early work concerning the classes of iterative problem solutions, led to a 15 year effort leading to SequenceL [Cooke 1996[Cooke , 1998]. In addition to automatically deriving many iterative and recursive algorithms to traverse data structures, we have also investigated the use of SequenceL to automatically discover and evaluate parallelizable subtasks [Cooke and Andersen 2000].…”
Section: Discussionmentioning
confidence: 99%
“…If this sounds hard, it is: it has been estimated that the cost of developing parallel programs averages $800 per line of code [Pancake 1999]. We have seen how SequenceL can diminish the programmer's burden by reducing the need for sequential control structures [Cooke 1996[Cooke , 1998]. Our recent research suggests that the language can be even more effective in reducing the burden of orchestrating parallel execution [Cooke and Andersen 2000;.…”
Section: Automatic Parallelismsmentioning
confidence: 99%
See 2 more Smart Citations
“…The goal of the SequenceL language [4,5] is to provide an environment where problem solutions can be stated at a high level of abstraction-where one can describe the data product explicitly and have the iterative and parallel program structures that produce and process the data product generated automatically. In other words, the desire is for a language that is based upon high level constructs that permit one to declare data products directly.…”
Section: Introductionmentioning
confidence: 99%