Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...
Abstract--Recently, we have introduced an approach to multicore computations on sparse matrices using recursive partitioning, called Recursive Sparse Blocks (RSB). In this document...
Michele Martone, Salvatore Filippone, Marcin Paprz...
Abstract Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the model...
Abstract. Writing an optimizing back end is expensive, in part because it requires mastery of both a target machine and a compiler's internals. We separate these concerns by i...