Sciweavers

113 search results - page 20 / 23
» Data memory minimization by sharing large size buffers
Sort
View
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 1 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
ICDM
2002
IEEE
167views Data Mining» more  ICDM 2002»
14 years 11 days ago
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu
SPAA
2004
ACM
14 years 25 days ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
CORR
2010
Springer
224views Education» more  CORR 2010»
13 years 7 months ago
A Cluster Based Replication Architecture for Load Balancing in Peer-to-Peer Content Distribution
In P2P systems, large volumes of data are declustered naturally across a large number of peers. But it is very difficult to control the initial data distribution because every use...
S. Ayyasamy, S. N. Sivanandam
PDCN
2004
13 years 8 months ago
Improving http-server performance by adapted multithreading
It is wellknown that http servers can be programmed easier by using multithreading, i.e. each connection is dealt with by a separate thread. It is also known, e.g. from massively ...
Jörg Keller, Olaf Monien