Sciweavers

3228 search results - page 327 / 646
» Basics of Compiler Design
Sort
View
IPPS
1999
IEEE
15 years 11 months ago
A Formal Framework for Specifying and Verifying Time Warp Optimizations
Parallel and distributed systems are representative of large and complex systems that require the application of formal methods. These systems are often unreliable because implemen...
Victoria Chernyakhovsky, Peter Frey, Radharamanan ...
DAWAK
1999
Springer
15 years 11 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
ICDCS
1996
IEEE
15 years 10 months ago
Group Routing without Group Routing Tables
We present a group routing protocol for a network of processes. The task of the protocol is to route data messages to each member of a process group. To this end, a tree of proces...
Jorge Arturo Cobb, Mohamed G. Gouda
SIGCOMM
1996
ACM
15 years 10 months ago
Hierarchical Packet Fair Queueing Algorithms
Hierarchical Packet Fair Queueing (H-PFQ)algorithms have the potential to simultaneously support guaranteed realtime service, rate-adaptive best-eort, and controlled linksharing s...
Jon C. R. Bennett, Hui Zhang
HOTOS
2009
IEEE
15 years 10 months ago
Simplifying Distributed System Development
Distributed systems are difficult to design and develop. The difficulties arise both in basic safety correctness properties, and in achieving high performance. As a result of this...
Maysam Yabandeh, Nedeljko Vasic, Dejan Kostic, Vik...