Search results for "message-passing systems"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg	The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems.	OPODIS	2009	DBLP DOI BibTeX RDF
2	Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg	Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems.	DISC	2009	DBLP DOI BibTeX RDF
2	François Bonnet, Michel Raynal	Looking for the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems: Is ${\it \Pi}_k${\it \Pi}_k the End of the Road?	SSS	2009	DBLP DOI BibTeX RDF
2	Gurdip Singh, Ye Su	Efficient Synchronization in Message Passing Systems.	AINA	2008	DBLP DOI BibTeX RDF	Synchronization, Message passing, Mutual Exclusion
2	Francesco Belardinelli, Alessio Lomuscio	A Complete Quantified Epistemic Logic for Reasoning about Message Passing Systems.	CLIMA	2007	DBLP DOI BibTeX RDF
2	Aniruddha G. Shet, P. Sadayappan, David E. Bernholdt, Jarek Nieplocha, Vinod Tipparaju	A Performance Instrumentation Framework to Characterize Computation-Communication Overlap in Message-Passing Systems.	CLUSTER	2006	DBLP DOI BibTeX RDF
2	Hideo Saito, Kenjiro Taura, Takashi Chikayama	Collective operations for wide-area message passing systems using adaptive spanning trees.	GRID	2005	DBLP DOI BibTeX RDF
2	B. Meenakshi, Ramaswamy Ramanujam	Reasoning about Layered Message Passing Systems.	VMCAI	2003	DBLP DOI BibTeX RDF
2	Gurdip Singh, Ye Su	Region Synchronization in Message Passing Systems. (PDF / PS)	ICPP	2002	DBLP DOI BibTeX RDF
2	Benedikt Bollig, Martin Leucker	Modelling, Specifying, and Verifying Message Passing Systems. (PDF / PS)	TIME	2001	DBLP DOI BibTeX RDF
2	Jan Bækgaard Pedersen, Alan S. Wagner	Correcting Errors in Message Passing Systems.	HIPS	2001	DBLP DOI BibTeX RDF
2	Dingchao Li, Yuji Iwahori, Tatsuya Hayashi, Naohiro Ishii	An Efficient Strategy for Task Duplication in Multiport Message-Passing Systems.	Euro-Par	1998	DBLP DOI BibTeX RDF
2	Panagiotis Melas, Ed Zaluska	Performance of Message-Passing Systems using a Zero-Copy Communication Protocol.	IEEE PACT	1998	DBLP DOI BibTeX RDF	zero-copy protocols, BIP, communication models performance, latency, communication protocols, bandwidth, cluster of workstations, message-passing systems
2	Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni	Towards a Characterisation of Finite-State Message-Passing Systems.	ASIAN	1998	DBLP DOI BibTeX RDF
2	Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Eli Upfal, Derrick Weathersby	Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems.	IEEE Trans. Parallel Distrib. Syst.	1997	DBLP DOI BibTeX RDF	concatenation operation, index operation, multiscatter/gather, distributed-memory system, parallel system, message-passing system, All-to-all broadcast, complete exchange, all-to-all personalized communication
2	Alan T. Krantz, Vaidy S. Sunderam	Client Server Computing on Message Passing Systems: Experiences with PVM-RPC.	Euro-Par	1997	DBLP DOI BibTeX RDF
2	Jürgen Brehm, Patrick H. Worley	Performance Prediction for Complex Parallel Applications. (PDF / PS)	IPPS	1997	DBLP DOI BibTeX RDF	complex parallel applications, massively parallel machines, parallel design decisions, parallelization strategies, Performance Prediction Tool, PerPreT, Parallel Spectral Transform Shallow Water Model code, parallel architectures, parallel architectures, performance prediction, message-passing systems, Intel Paragon
2	Daniel Lenoski	Design issues for distributed shared-memory systems. (PDF / PS)	ICCD	1996	DBLP DOI BibTeX RDF	cluster-based systems, scalability, distributed memory systems, DSM, message-passing systems, distributed shared-memory systems, MPP
2	Yi-Min Wang, Pi-Yu Chung, In-Jen Lin, W. Kent Fuchs	Checkpoint Space Reclamation for Uncoordinated Checkpointing in Message-Passing Systems..	IEEE Trans. Parallel Distrib. Syst.	1995	DBLP DOI BibTeX RDF
2	Hagit Attiya, Amotz Bar-Noy, Danny Dolev	Sharing Memory Robustly in Message-Passing Systems.	J. ACM	1995	DBLP DOI BibTeX RDF	processor and link failures, fault-tolerance, message passing, shared memory, emulation, atomic registers, wait-freedom
2	Konstantin Trachos, Erik Maehle	A class hierarchy emulating virtual shared objects on message-passing systems.	PDP	1995	DBLP DOI BibTeX RDF	virtual shared objects, scalable performance, composite virtual objects, object-oriented abstractions, shared composite virtual objects, parallel programming, parallel programming, object-oriented programming, C++, message passing, shared memory, shared memory systems, distributed memory systems, type theory, interaction protocol, distributed memory, data types, C language, shared objects, message-passing systems, class hierarchy
2	Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber	Computing Global Combine Operations in the Multiport Postal Model.	IEEE Trans. Parallel Distrib. Syst.	1995	DBLP DOI BibTeX RDF	Census computation, global combine, multiple ports, distributed systems, parallel computers, gossiping, message-passing systems, postal model
2	Mayez A. Al-Mouhamed, Adel Al-Maasarani	Performance Evaluation of Scheduling Precedence-Constained Computations on Message-Passing Systems.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	scheduling precedence-constrained computations, multiprocessor topology, global priority-based schedulingheuristics, generalized list scheduling, backward scheduling, graph-driven scheduling, scheduling, performance evaluation, performance evaluation, computational complexity, multiprocessor, message passing, network topology, time complexity, message-passing systems
2	Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Derrick Weathersby	Efficient Algorithms for All-to-All Communications in Multi-Port Message-Passing Systems.	SPAA	1994	DBLP DOI BibTeX RDF
2	Michael González Harbour, Mark H. Klein, John P. Lehoczky	Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	periodic task set, fixed-priority methods, serially executed subtasks, complex priority structure, nonpreemptible sections, scheduling, schedulability, real-time systems, robots, robotics, message passing, interrupts, interrupts, timing analysis, execution time, hard real-time systems, fixed-priority scheduling, precedence constraints, periodic tasks, message-passing systems, synchronization protocols, uniprocessor
2	Min-You Wu, Daniel Gajski	Hypertool: A Programming Aid for Message-Passing Systems.	IEEE Trans. Parallel Distrib. Syst.	1990	DBLP DOI BibTeX RDF	Hypertool, programming aid, automation concepts, communication primitive insertion, synchronization errors, program quality measures, scheduling, scheduling, software tools, performance estimates, message-passing systems, electronic messaging, critical-path method
1	Ghada F. El-Kabbany, Nayer M. Wanas, Nadia H. Hegazi, Samir I. Shaheen	A Dynamic Load Balancing Framework for Real-time Applications in Message Passing Systems.	International Journal of Parallel Programming	2011	DBLP DOI BibTeX RDF
1	François Bonnet, Michel Raynal	On the road to the weakest failure detector for k-set agreement in message-passing systems.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Concetta Pilotto, Jerome White	Towards a verification framework for faulty message passing systems in PVS.	ISSE	2011	DBLP DOI BibTeX RDF
1	Martin Biely, Peter Robinson, Ulrich Schmid	Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems	CoRR	2011	DBLP BibTeX RDF
1	Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg	The minimum information about failures for solving non-local tasks in message-passing systems.	Distributed Computing	2011	DBLP DOI BibTeX RDF
1	Miguel Correia, Giuliana Santos Veronese, Nuno Ferreira Neves, Paulo Veríssimo	Byzantine consensus in asynchronous message-passing systems: a survey.	IJCCBS	2011	DBLP DOI BibTeX RDF
1	Jesper Larsson Träff	Scan for Distributed Memory, Message-Passing Systems.	Encyclopedia of Parallel Computing	2011	DBLP DOI BibTeX RDF
1	Subodh Sharma, Ganesh Gopalakrishnan	Efficient Verification Solutions for Message Passing Systems.	IPDPS Workshops	2011	DBLP DOI BibTeX RDF
1	Martin Biely, Peter Robinson, Ulrich Schmid	Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems.	OPODIS	2011	DBLP DOI BibTeX RDF
1	Emanuele G. Fusco, Andrzej Pelc	Communication Complexity of Consensus in Anonymous Message Passing Systems.	OPODIS	2011	DBLP DOI BibTeX RDF
1	Martin Biely, Peter Robinson, Ulrich Schmid	Easy impossibility proofs for k-set agreement in message passing systems.	PODC	2011	DBLP DOI BibTeX RDF
1	Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil	Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems.	SSS	2011	DBLP DOI BibTeX RDF
1	Achour Mostéfaoui, Michel Raynal, Julien Stainer	Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems.	SSS	2011	DBLP DOI BibTeX RDF
1	François Bonnet, Michel Raynal	A simple proof of the necessity of the failure detector Sigma to implement an atomic register in asynchronous message-passing systems.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	Sylvie Delaët, Stéphane Devismes, Mikhail Nesterenko, Sébastien Tixeuil	Snap-stabilization in message-passing systems.	J. Parallel Distrib. Comput.	2010	DBLP DOI BibTeX RDF
1	Dariusz R. Kowalski, Mariam Momenzadeh, Alexander A. Shvartsman	Emulating shared-memory Do-All algorithms in asynchronous message-passing systems.	J. Parallel Distrib. Comput.	2010	DBLP DOI BibTeX RDF
1	Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke	Propositional Dynamic Logic for Message-Passing Systems	Logical Methods in Computer Science	2010	DBLP BibTeX RDF
1	Michel Raynal	Fault-tolerant Agreement in Synchronous Message-passing Systems		2010	DOI RDF
1	Chia-Chu Chiang, Shen Lu	Distributed Association Mining on Message Passing Systems.	ISPA	2010	DBLP DOI BibTeX RDF	Data Mining, Distributed Computing, Association Rules, Frequent Itemsets, Apriori
1	François Bonnet, Michel Raynal	Early Consensus in Message-Passing Systems Enriched with a Perfect Failure Detector and Its Application in the Theta Model.	EDCC	2010	DBLP DOI BibTeX RDF	Asynchronous message-passing system, Early decision, Perfect failure detector, Theta-model, Consensus problem
1	Marco Serafini, Dan Dobre, Matthias Majuntke, Péter Bokor, Neeraj Suri	Eventually linearizable shared objects.	PODC	2010	DBLP DOI BibTeX RDF	eventual linearizability, availability, graceful degradation
1	Miguel Correia, Giuliana Santos Veronese, Lau Cheuk Lung	Asynchronous Byzantine consensus with 2f+1 processes.	SAC	2010	DBLP DOI BibTeX RDF	distributed algorithms, consensus, Byzantine fault tolerance
1	Shlomi Dolev, Nir Tzachar	Spanders: distributed spanning expanders.	SAC	2010	DBLP DOI BibTeX RDF	self-orgenization, self-stabilization, expanders
1	Sylvie Delaët, Stéphane Devismes, Mikhail Nesterenko, Sébastien Tixeuil	Snap-Stabilization in Message-Passing Systems.	ICDCN	2009	DBLP DOI BibTeX RDF
1	Austin Anderson, Julian Rathke	Migrating Protocols in Multi-Threaded Message-Passing Systems.	HotSWUp	2009	DBLP DOI BibTeX RDF
1	Jiayuan Meng, Kevin Skadron	Performance modeling and automatic ghost zone optimization for iterative stencil loops on GPUs.	ICS	2009	DBLP DOI BibTeX RDF	ghost zone, parallel computing, gpu, stencil computation
1	Marcos Kawazoe Aguilera, Idit Keidar, Dahlia Malkhi, Alexander Shraer	Dynamic atomic storage without consensus.	PODC	2009	DBLP DOI BibTeX RDF	atomic storage, dynamic systems, shared-memory emulations
1	Vibhor Bhatt, Nicholas Christman, Prasad Jayanti	Extracting quorum failure detectors.	PODC	2009	DBLP DOI BibTeX RDF	fault tolerance, mutual exclusion, asynchronous system, failure detector
1	François Bonnet, Michel Raynal	Brief announcement: the price of anonymity: optimal consensus despite asynchrony, crash and anonymity.	PODC	2009	DBLP DOI BibTeX RDF	anonymous systems, distributed agreement
1	Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Strojnowski	Fast scalable deterministic consensus for crash failures.	PODC	2009	DBLP DOI BibTeX RDF	bit communication complexity, graph expansion, fault tolerance, scalability, message passing, consensus, synchrony
1	Vasco Thudichum Vasconcelos	Session types for linear multithreaded functional programming.	PPDP	2009	DBLP DOI BibTeX RDF	linear type systems, concurrency, functional programming, session types
1	Bogdan S. Chlebus, Dariusz R. Kowalski	Locally scalable randomized consensus for synchronous crash failures.	SPAA	2009	DBLP DOI BibTeX RDF	bit communication complexity, graph expansion, fault tolerance, scalability, lower bound, message passing, randomization, consensus, synchrony
1	Srikanth Sastry, Scott M. Pike, Jennifer L. Welch	The weakest failure detector for wait-free dining under eventual weak exclusion.	SPAA	2009	DBLP DOI BibTeX RDF	mutual exclusion, failure detectors, wait-freedom, partial synchrony, dining philosophers
1	Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore	Self-Stabilizing k-out-of-l exclusion on tree networks.	IPDPS	2009	DBLP DOI BibTeX RDF
1	Alysson Neves Bessani, Miguel Correia, Joni da Silva Fraga, Lau Cheuk Lung	Sharing Memory between Byzantine Processes Using Policy-Enforced Tuple Spaces.	IEEE Trans. Parallel Distrib. Syst.	2009	DBLP DOI BibTeX RDF
1	Martin Biely, Peter Robinson, Ulrich Schmid	Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement.	OPODIS	2009	DBLP DOI BibTeX RDF
1	Andreas Haeberlen, Petr Kuznetsov	The Fault Detection Problem.	OPODIS	2009	DBLP DOI BibTeX RDF	fault detection problem, lower bounds, message complexity, Fault classes
1	Martin Biely, Peter Robinson, Ulrich Schmid	Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement.	DISC	2009	DBLP DOI BibTeX RDF
1	Francesco Belardinelli, Alessio Lomuscio	First-Order Linear-Time Epistemic Logic with Group Knowledge: An Axiomatisation of the Monodic Fragment.	WoLLIC	2009	DBLP DOI BibTeX RDF
1	Angel Alvarez, Sergio Arévalo, Vicent Cholvi, Antonio Fernández, Ernesto Jiménez	On the interconnection of message passing systems.	Inf. Process. Lett.	2008	DBLP DOI BibTeX RDF
1	Hideo Saito, Kenjiro Taura, Takashi Chikayama	Collective operations for wide-area message-passing systems using adaptive spanning trees.	IJHPCN	2008	DBLP DOI BibTeX RDF
1	Sylvie Delaët, Stéphane Devismes, Mikhail Nesterenko, Sébastien Tixeuil	Snap-Stabilization in Message-Passing Systems	CoRR	2008	DBLP BibTeX RDF
1	Michael Okun, Amnon Barak, Eli Gafni	Renaming in synchronous message passing systems with Byzantine failures.	Distributed Computing	2008	DBLP DOI BibTeX RDF	Renaming problem, Synchronous message passing model, Byzantine failures
1	Eric Ruppert	Implementing Shared Registers in Asynchronous Message-Passing Systems.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
1	Puneet Bhateja, Madhavan Mukund	Tagging Make Local Testing of Message-Passing Systems Feasible.	SEFM	2008	DBLP DOI BibTeX RDF
1	Justin C. Y. Ho, Cho-Li Wang, Francis C. M. Lau	Scalable group-based checkpoint/restart for large-scale message-passing systems.	IPDPS	2008	DBLP DOI BibTeX RDF
1	Sylvie Delaët, Stéphane Devismes, Mikhail Nesterenko, Sébastien Tixeuil	Snap-stabilization in message-passing systems.	PODC	2008	DBLP DOI BibTeX RDF
1	Timothy J. Rolfe	Perverse and foolish oft I strayed.	SIGCSE Bulletin	2008	DBLP DOI BibTeX RDF	permutation generation, distributed processing, branch and bound, backtracking, algorithm analysis
1	Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman	On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory.	DISC	2008	DBLP DOI BibTeX RDF
1	Aniruddha G. Shet, P. Sadayappan, David E. Bernholdt, Jarek Nieplocha, Vinod Tipparaju	A framework for characterizing overlap of communication and computation in parallel applications.	Cluster Computing	2008	DBLP DOI BibTeX RDF	Performance instrumentation and monitoring, Parallel applications, Latency hiding, Communication-computation overlap
1	Rachid Guerraoui, Petr Kouznetsov	Failure detectors as type boosters.	Distributed Computing	2008	DBLP DOI BibTeX RDF
1	SeungJun Bang, JinHo Ahn	Implementation and Performance Evaluation of Socket and RMI based Java Message Passing Systems.	SERA	2007	DBLP DOI BibTeX RDF
1	Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke	Propositional Dynamic Logic for Message-Passing Systems.	FSTTCS	2007	DBLP DOI BibTeX RDF
1	Nicolas Baudru, Rémi Morin	Synthesis of Safe Message-Passing Systems.	FSTTCS	2007	DBLP DOI BibTeX RDF
1	Hideo Saito, Kenjiro Taura	Locality-aware connection management and rank assignment for wide-area MPI.	PPOPP	2007	DBLP DOI BibTeX RDF	connection establishment, rank assignment, adaptivity, grid, MPI, message passing, communication optimization
1	Antonio Fernández, Ernesto Jiménez, Michel Raynal	Electing an Eventual Leader in an Asynchronous Shared Memory System.	DSN	2007	DBLP DOI BibTeX RDF
1	Yantao Song, Scott M. Pike	Eventually k-Bounded Wait-Free Distributed Daemons.	DSN	2007	DBLP DOI BibTeX RDF	self-stabilization, wait-freedom, daemons
1	Angelo Duarte, Dolores Rexachs, Emilio Luque	Functional Tests of the RADIC Fault Tolerance Architecture.	PDP	2007	DBLP DOI BibTeX RDF
1	Wei Chen 0013, Jialin Zhang, Yu Chen, Xuezheng Liu	Failure Detectors and Extended Paxos for k-Set Agreement.	PRDC	2007	DBLP DOI BibTeX RDF
1	Nishant Sinha, Edmund M. Clarke	SAT-Based Compositional Verification Using Lazy Learning.	CAV	2007	DBLP DOI BibTeX RDF
1	Clayton S. Ferner	Revisiting communication code generation algorithms for message-passing systems.	IJPEDS	2006	DBLP DOI BibTeX RDF
1	Jan Bækgaard Pedersen	Classification of Programming Errors in Parallel Message Passing Systems.	CPA	2006	DBLP BibTeX RDF
1	Michael Okun, Amnon Barak	Renaming in Message Passing Systems with Byzantine Failures.	DISC	2006	DBLP DOI BibTeX RDF
1	Vaidy S. Sunderam	Resource and Application Adaptivity in Message Passing Systems.	PVM/MPI	2006	DBLP DOI BibTeX RDF
1	Ayon Basumallik, Rudolf Eigenmann	Optimizing irregular shared-memory applications for distributed-memory systems.	PPOPP	2006	DBLP DOI BibTeX RDF	computation-communication overlap, iteration reordering, performance, MPI, OpenMP, compiler techniques
1	Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman	Fault-tolerant semifast implementations of atomic read/write registers.	SPAA	2006	DBLP DOI BibTeX RDF	communication rounds, read/write registers, fault-tolerance, distributed algorithms, atomicity
1	Antonio Fernández, Ernesto Jiménez, Michel Raynal	Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony.	DSN	2006	DBLP DOI BibTeX RDF
1	Alysson Neves Bessani, Joni da Silva Fraga, Miguel Correia, Lau Cheuk Lung	Sharing Memory between Byzantine Processes using Policy-Enforced Tuple Spaces.	ICDCS	2006	DBLP DOI BibTeX RDF
1	Puneet Bhateja, Paul Gastin, Madhavan Mukund	A Fresh Look at Testing for Asynchronous Communication.	ATVA	2006	DBLP DOI BibTeX RDF
1	Heinrich Moser, Ulrich Schmid	Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems.	OPODIS	2006	DBLP DOI BibTeX RDF
1	Tomas Plachetka	Unifying Framework for Message Passing.	SOFSEM	2006	DBLP DOI BibTeX RDF
1	Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman	Brief Announcement: Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers.	DISC	2006	DBLP DOI BibTeX RDF
1	Alex Brodsky, Jan Bækgaard Pedersen, Alan S. Wagner	On the complexity of buffer allocation in message passing systems.	J. Parallel Distrib. Comput.	2005	DBLP DOI BibTeX RDF
1	Sibsankar Haldar	Constructing regular variables in message passing systems.	J. Parallel Distrib. Comput.	2005	DBLP DOI BibTeX RDF