Sciweavers

3202 search results - page 239 / 641
» Memory access scheduling
Sort
View
CEC
2010
IEEE
15 years 7 months ago
Providing a memory mechanism to enhance the evolutionary design of heuristics
Genetic programming approaches have previously been employed in the literature to evolve heuristics for various combinatorial optimisation problems. This paper presents a hyper-heu...
Edmund K. Burke, Matthew R. Hyde, Graham Kendall
IS
2008
15 years 6 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
NETWORK
2007
145views more  NETWORK 2007»
15 years 5 months ago
Analysis of Shared Memory Priority Queues with Two Discard Levels
— Two rate SLAs become increasingly popular in today’s Internet, allowing a customer to save money by paying one price for committed traffic and a much lower price for additio...
Shlomi Bergida, Yuval Shavitt
CLOUDCOM
2010
Springer
15 years 4 months ago
REMEM: REmote MEMory as Checkpointing Storage
Checkpointing is a widely used mechanism for supporting fault tolerance, but notorious in its high-cost disk access. The idea of memory-based checkpointing has been extensively stu...
Hui Jin, Xian-He Sun, Yong Chen, Tao Ke
CJ
2010
190views more  CJ 2010»
15 years 3 months ago
A Methodological Construction of an Efficient Sequentially Consistent Distributed Shared Memory
A concurrent object is an object that can be concurrently accessed by several processes. Sequential consistency is a consistency criterion for such objects. Informally, it states ...
Vicent Cholvi, Antonio Fernández, Ernesto J...