Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
d Abstract) Mitsuhisa Sato1 , Motonari Hirano2 , Yoshio Tanaka2 , and Satoshi Sekiguchi2 1 Real World Computing Partnership, Tsukuba, Japan 2 Software Research Associates, Inc 3 El...
Recently, we presented two very low-cost approaches to compile-time list scheduling where the tasks’ priorities are computed statically or dynamically, respectively. For homogen...
Main memory accesses continue to be a significant bottleneck for applications whose working sets do not fit in second-level caches. With the trend of greater associativity in seco...
Multimedia instruction set extensions have become a prominent feature in desktop microprocessor platforms, promising superior performance on a wide range of floating-point and int...