Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
The performance of computer systems depends, among other things, on the workload. This motivates the use of real workloads (as recorded in activity logs) to drive simulations of n...
Analytic applications from various industrial sectors have specific attributes and requirements including relatively long processing time, parallelization, multiple interactive in...
L. L. Fong, Catherine H. Crawford, Hidayatullah Sh...
Loop distribution is one of the most useful techniques to reduce the execution time of parallel applications. Traditionally, loop scheduling algorithms are implemented based on pa...
Information about online presence allows participants of instant messaging (IM) systems to determine whether their prospective communication partners will be able to answer their ...
Karsten Loesing, Markus Dorsch, Martin Grote, Knut...