Sciweavers

526 search results - page 42 / 106
» Type Abstractions of Name-Passing Processes
Sort
View
129
Voted
PDPTA
2007
15 years 5 months ago
Communication with Super Flexible Messaging
Abstract Super Flexible Messaging (SFM) provides a powerful and elegant message passing abstraction for transferring arbitrary data between remote processes. SFM achieves the simpl...
Alexey Fedosov, Gregory Benson
133
Voted
IJMMS
2008
90views more  IJMMS 2008»
15 years 3 months ago
Pair programming and the mysterious role of the navigator
Computer programming is generally understood to be highly challenging and since its inception a wide range of approaches, tools and methodologies have been developed to assist in ...
Sallyann Bryant, Pablo Romero, Benedict du Boulay
115
Voted
INTERNET
2006
119views more  INTERNET 2006»
15 years 3 months ago
Toward a Grid-Based DBMS
level is a grid abstract machine, which consists of a collection of typed nodes -- data nodes (purple), director nodes (red), management nodes (orange), and various processing node...
Craig W. Thompson
167
Voted
BMCBI
2011
14 years 7 months ago
Assessing the functional coherence of modules found in multiple-evidence networks from Arabidopsis
Background: Combining multiple evidence-types from different information sources has the potential to reveal new relationships in biological systems. The integrated information ca...
Artem Lysenko, Michael Defoin-Platel, Keywan Hassa...
PLDI
2012
ACM
13 years 6 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa