DI: an interactive debugging interpreter for applicative languages

Skedzielewski, S.; Yates, Robert K.; Oldehoeft, R. R.

doi:10.1145/29650.29661

Cited by 12 publications

(5 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sisal [17] is a pure, first-order, functional programming language with loops and arrays. Sisal programs are initially compiled into a functional, block-structured, acyclic, data dependence graph form IF1 [18]. The functional semantics of IF1 prohibits the expression of copy-avoiding optimizations.…”

Section: Code Generationmentioning

confidence: 99%

Resource Management in Dataflow-Based Multithreaded Execution

Roh

Shankar

Bohm

et al. 2001

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Due to the large amount of potential parallelism, resource management is a critical issue in multithreaded execution. The challenge in code generation is to control the parallelism without reducing the machine's ability to exploit it. Controlled parallelism reduces idle time, communication, and delay caused by synchronization. At the same time it increases the potential for exploitation of program data structure locality. In this paper, we evaluate the performance of methods to control program parallelism and resource usage in the context of the fine-grain dataflow execution model. The methods are in themselves not new, but their performance analysis is. The two methods to control parallelism here are slicing and chunking. We present the methods and their compilation strategy and evaluate their effectiveness in terms of run time and matching store occupancy. Communication is categorized in memory, loop, call, and expression communication. Input and output message locality is measured. Two techniques to reduce communication are introduced. Grouping allocates loop and function bodies on one processor and bundling combines messages with the same sender and receiver into one. Their effects on the total communication volume are quantified. Academic Press

show abstract

Section: Code Generationmentioning

confidence: 99%

Resource Management in Dataflow-Based Multithreaded Execution

Roh

Shankar

Bohm

et al. 2001

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…I ) IF-I: An Intermediate Form for Applicative Languages: IF-1 is a language based on acyclic graphs [29]. Each graph comprises four components: nodes, edges, types and graph boundaries.…”

Section: A Functional Parallelism In Sisalmentioning

confidence: 99%

A scalable scheduling scheme for functional parallelism on distributed memory multiprocessor systems

Pande

Agrawal²,

Mauney³

1995

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

We attempt a new variant of the scheduling problem by investigating the scalability of the schedule length with the required number of processors, by performing scheduling partially at compile time and partially at run time.Assuming infinite number of processors, the compile time schedule is found using a new concept of the threshold of a task that quantifies a trade-off between the schedule-length and the degree of parallelism. The schedule is found to minimize either the schedule length or the number of required processors and it satisfies:A feasibility condition which guarantees that the schedule delay of a task from its earliest start time is below the threshold, and An optimality condition which uses a merit function to decide the best task-processor match for a set of tasks competing for a given processor.At run time, the tasks are merged producing a schedule for a smaller number of available processors. This allows the program to be scaled down to the processors actually available at run time. Usefulness of this scheduling heuristic has been demonstrated by incorporating the scheduler in the compiler backend for targeting Sisal (Streams and Iterations in a Single Assignment Language) on iPSCB60.

show abstract

“…The algorithm has been implemented in the backend of the compiler for the parallel functional language Sisal (Streams and Iterations in Single Assignment Language). For details about Sisal refer to [9,16].…”

Section: Introductionmentioning

confidence: 99%