Sciweavers

287 search results - page 32 / 58
» Introducing parallelism and concurrency in the data structur...
Sort
View
SPAA
2005
ACM
15 years 6 months ago
Using elimination to implement scalable and lock-free FIFO queues
This paper shows for the first time that elimination, a scaling technique formerly applied only to counters and LIFO structures, can be applied to FIFO data structures, specific...
Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit
EUROPAR
2007
Springer
15 years 7 months ago
A Structured Overlay for Multi-dimensional Range Queries
Abstract. We introduce SONAR, a structured overlay to store and retrieve objects addressed by multi-dimensional names (keys). The overlay has the shape of a multi-dimensional torus...
Thorsten Schütt, Florian Schintke, Alexander ...
EMNLP
2008
15 years 2 months ago
Revealing the Structure of Medical Dictations with Conditional Random Fields
Automatic processing of medical dictations poses a significant challenge. We approach the problem by introducing a statistical framework capable of identifying types and boundarie...
Jeremy Jancsary, Johannes Matiasek, Harald Trost
JSSPP
2009
Springer
15 years 7 months ago
Contention-Aware Scheduling with Task Duplication
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...
Oliver Sinnen, Andrea To, Manpreet Kaur
IPPS
1998
IEEE
15 years 5 months ago
Memory Space Representation for Heterogeneous Network Process Migration
A major difficulty of heterogeneous process migration is how to collect advanced dynamic data-structures, transform them into machine independent form, and restor them appropriate...
Kasidit Chanchio, Xian-He Sun