Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Philip W. Trinder"'
Publikováno v:
Concurrency and Computation: Practice and Experience. 25:309-348
SUMMARY Predicting the resources that are consumed by a program component is crucial for many parallel or distributed systems. In this context, the main resources of interest are execution time, space and communication/synchronisation costs. There ha
Publikováno v:
Parallel Processing Letters. 15:273-288
In mobile languages programmers control the placement of code or computations in open networks, e.g., a program can migrate between locations. Mobile computations are typically stateful and interact with the state at each location in the network. We
Publikováno v:
The Computer Journal. 45:436-452
Publikováno v:
SCALA@ECOOP
Scala supports actors and message passing with the Akka library. Though Scala is statically typed, messages in Akka are dynamically typed (that is, of type Any). The Akka designers argue that using static types is "impossible" because "actor behaviou
Publikováno v:
Parallel Processing Letters. 11:471-486
The performance of data parallel programs often hinges on two key coordination aspects: the computational costs of the parallel tasks relative to their management overhead — task granularity; and the communication costs induced by the distance betw
Autor:
Kevin Hammond, Philip W. Trinder, Richard G. Morgan, Hans-Wolfgang Loidl, Simon Jones, Sahalu B. Junaidu
Publikováno v:
Concurrency-Practice and Experience
We investigate the claim that functional languages offer low-cost parallelism in the context of symbolic programs on modest parallel architectures. In our investigation we present the first comparative study of the construction of large applications
Publikováno v:
Journal of Functional Programming. 8:23-60
The process of writing large parallel programs is complicated by the need to specify both the parallel behaviour of the program and the algorithm that is to be used to compute its result. This paper introduces evaluation strategies: lazy higher-order
Autor:
Daniel K. C. Chan, Philip W. Trinder
Publikováno v:
Information and Software Technology. 39:641-651
In order to execute database queries efficiently, they are usually translated into an algebra: a small set of operations together with some equivalences. The operations are implemented very efficiently by the database engine, and the equivalences are
Publikováno v:
The Computer Journal. 37:858-872
Different query languages have been implemented and others proposed for object-oriented database systems. Evaluating and comparing these languages has been difficult due to the lack of a frame of reference. This paper establishes such a framework usi
Publikováno v:
DBPL