Sciweavers

23557 search results - page 4287 / 4712
» Distributed Computing - Introduction
Sort
View
JIIS
2002
99views more  JIIS 2002»
15 years 4 months ago
Efficient Management of Persistent Knowledge
Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memo...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...
MST
2002
152views more  MST 2002»
15 years 4 months ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir
NRHM
1998
124views more  NRHM 1998»
15 years 4 months ago
Adaptable and adaptive information provision for all users, including disabled and elderly people
: Due to the tremendously increasing popularity of the World-Wide Web, hypermedia is going to be the leading online information medium for some years to come and will most likely b...
Josef Fink, Alfred Kobsa, Andreas Nill
PC
1998
202views Management» more  PC 1998»
15 years 4 months ago
BSPlib: The BSP programming library
BSPlib is a small communications library for bulk synchronous parallel (BSP) programming which consists of only 20 basic operations. This paper presents the full de nition of BSPl...
Jonathan M. D. Hill, Bill McColl, Dan C. Stefanesc...
TPDS
1998
98views more  TPDS 1998»
15 years 4 months ago
A Basic-Cycle Calculation Technique for Efficient Dynamic Data Redistribution
—Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at run-time, ther...
Yeh-Ching Chung, Ching-Hsien Hsu, Sheng-Wen Bai
« Prev « First page 4287 / 4712 Last » Next »