Sciweavers

923 search results - page 129 / 185
» The Computational Structure of Progress Conditions
Sort
View
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
15 years 10 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
PAM
2010
Springer
15 years 4 months ago
Toward Topology Dualism: Improving the Accuracy of AS Annotations for Routers
Abstract. To describe, analyze, and model the topological and structural characteristics of the Internet, researchers use Internet maps constructed at the router or autonomous syst...
Bradley Huffaker, Amogh Dhamdhere, Marina Fomenkov...
ICPP
2009
IEEE
15 years 4 months ago
Code Semantic-Aware Runahead Threads
Memory-intensive threads can hoard shared resources without making progress on a multithreading processor (SMT), thereby hindering the overall system performance. A recent promisi...
Tanausú Ramírez, Alex Pajuelo, Olive...
SEMWEB
2007
Springer
15 years 3 months ago
Change Paths in Reasoning!
Millions of research funding has been put down to develop - what I call - old forms - of reasoning that are characterized by strong focus on theoretical properties and strict adher...
Raphael Volz
DCC
2000
IEEE
15 years 2 months ago
Multi-Resolution Adaptation of the SPIHT Algorithm for Multiple Description
Multiple description codes are data compression algorithms designed with the goal of minimizing the distortion caused by data loss in packet-based or diversity communications syst...
Nedeljko Varnica, Michael Fleming, Michelle Effros