Sciweavers

8099 search results - page 1392 / 1620
» Higher-Order Task Models
Sort
View
ISPAN
2002
IEEE
15 years 11 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
ITCC
2002
IEEE
15 years 11 months ago
Design and Generation of Adaptable Web Information Systems with KIWIS
Web-based Information Systems (WIS) are now widely used for diffusing and processing information over the network. Methodological guidelines which assist WIS developers in their t...
Marlène Villanova-Oliver, Jérô...
VL
2002
IEEE
100views Visual Languages» more  VL 2002»
15 years 11 months ago
Using HCI Techniques to Design a More Usable Programming System
A programming system is the user interface between the programmer and the computer. Programming is a notoriously difficult activity, and some of this difficulty can be attribute...
John F. Pane, Brad A. Myers, Leah B. Miller
WORDS
2002
IEEE
15 years 11 months ago
Writing Temporally Predictable Code
The Worst-Case Execution-Time Analysis (WCET Analysis) of program code that is to be executed on modern processors is a highly complex task. First, it involves path analysis, to i...
Peter P. Puschner, Alan Burns
SIGMOD
2010
ACM
377views Database» more  SIGMOD 2010»
15 years 11 months ago
Online aggregation and continuous query support in MapReduce
MapReduce is a popular framework for data-intensive distributed computing of batch jobs. To simplify fault tolerance, the output of each MapReduce task and job is materialized to ...
Tyson Condie, Neil Conway, Peter Alvaro, Joseph M....
« Prev « First page 1392 / 1620 Last » Next »