Sciweavers

2432 search results - page 11 / 487
» Using simple abstraction to reinvent computing for paralleli...
Sort
View
CONCUR
2003
Springer
15 years 2 months ago
Full Abstraction for HOPLA
traction for HOPLA Mikkel Nygaard1 and Glynn Winskel2 1 BRICS , University of Aarhus 2 Computer Laboratory, University of Cambridge A fully abstract denotational semantics for the ...
Mikkel Nygaard, Glynn Winskel
85
Voted
JCP
2008
162views more  JCP 2008»
14 years 9 months ago
A Hypercube-based Scalable Interconnection Network for Massively Parallel Computing
An important issues in the design of interconnection networks for massively parallel computers is scalability. A new scalable interconnection network topology, called Double-Loop H...
Youyao Liu, Jungang Han, Huimin Du
TASLP
2010
118views more  TASLP 2010»
14 years 8 months ago
Time-Frequency Sparsity by Removing Perceptually Irrelevant Components Using a Simple Model of Simultaneous Masking
Abstract—We present an algorithm for removing timefrequency components, found by a standard Gabor transform, of a “real-world” sound while causing no audible difference to th...
Péter Balázs, Bernhard Laback, Gerha...
PODC
1999
ACM
15 years 1 months ago
LOTEC: A Simple DSM Consistency Protocol for Nested Object Transactions
In this paper, we describe an e cient software-only Distributed Shared Memory (DSM) consistency protocol for an unconventional but important application domain - object transactio...
Peter C. J. Graham, Yahong Sui
IPPS
2006
IEEE
15 years 3 months ago
Using virtual grids to simplify application scheduling
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...
Richard Y. Huang, Henri Casanova, Andrew A. Chien