Sciweavers

822 search results - page 42 / 165
» Contention in shared memory algorithms
Sort
View
ESOP
2000
Springer
14 years 13 days ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
DATE
2008
IEEE
130views Hardware» more  DATE 2008»
13 years 10 months ago
A Dual-Priority Real-Time Multiprocessor System on FPGA for Automotive Applications
This paper presents the implementation of a dualpriority scheduling algorithm for real-time embedded systems on a shared memory multiprocessor on FPGA. The dual-priority microkern...
Antonino Tumeo, Marco Branca, Lorenzo Camerini, Ma...
CODES
2004
IEEE
14 years 17 days ago
Efficient exploration of on-chip bus architectures and memory allocation
Separation between computation and communication in system design allows the system designer to explore the communication architecture independently of component selection and map...
Sungchan Kim, Chaeseok Im, Soonhoi Ha
ICDE
2007
IEEE
103views Database» more  ICDE 2007»
14 years 10 months ago
TCAM-conscious Algorithms for Data Streams
Recently, there has been significant interest in developing space and time efficient solutions for answering continuous summarization queries over data streams. While these techni...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
ICDCS
1995
IEEE
14 years 12 days ago
Implementing Sequentially Consistent Shared Objects Using Broadcast and Point-to-Point Communication
A distributed algorithm that implements a sequentially consistent collection of shared read/update objects using a combination of broadcast and point-to-point communication is pre...
Alan Fekete, M. Frans Kaashoek, Nancy A. Lynch