High performance peer-to-peer desktop grid computing: architecture, methods, applications

Although today’s largest Desktop Grid harvests idle cycles from only 0.46‰ of the Personal Computers (PC) deployed world-wide, it is way ahead of the currently fastest supercomputer with respect to raw computing performance. If it were possible to attract roughly 7% of the world’s PC owners to donate their resources, the resulting virtual supercomputer would right now punch through the exascale barrier expected to be broken by supercomputers not until around the year 2020. However, the full potential of Desktop Grid Computing has not yet been unleashed in another respect: application support. Due to their centralized interaction model Desktop Grids are currently limited to embarrassingly parallel applications. By complementing the foundations of Desktop Grid Computing systems with Peer-to-Peer concepts and methods, their scope can be extended to non-trivial applications from the field of High-Performance Computing, like parallel search problems – including discrete optimization, constraint satisfaction, and satisfiability solving –, Raytracing, or N-Body simulations. These applications are all instances of a special class of parallel applications called Irregularly Structured Problems (ISP). Their computation and interaction patterns are input-dependent, unstructured, and evolving. The incorporation of Peer-to-Peer methods has impact on many aspects of Desktop Grid Computing systems: Their architecture has to be retrofitted to support decentralized operation by multiple authorities in a secure and safe environment. The plethora of algorithmic alternatives available beyond Client/Server interaction requires the system to be designed for extensibility from the ground up. Solving task-parallel ISPs requires much more sophisticated platform support in the form of a distributed task pool that is able to perform dynamic decomposition, load balancing, and termination detection in a decentralized and fault-tolerant way. To support this decentralized execution model the underlying network substrate must provide efficient Peer-to-Peer unicast and multicast primitives and the ability to rapidly report available resources and their vanishing, both without seriously impairing scalability. Cohesion, the next generation Desktop Grid Computing platform described in this thesis, is an amalgamation of novel approaches designed to tackle these challenges. It’s capacity to efficiently execute task-parallel ISPs in volatile and heterogeneous Desktop Grids is demonstrated by means of Satciety, a state-of-the-art distributed SAT solver build on top of Cohesion. Obwohl das derzeit groste Desktop Grid der Welt nur etwa 0.46‰ der Ressourcen der weltweit vorhandenen Personal Computer (PC) nutzt, ist es bezuglich der reinen Rechenkraft dennoch deutlich leistungsfahiger als die zurzeit schnellsten Supercomputer. Gelange es nur 7% der weltweiten PC Eigentumer zu uberzeugen die Ressourcen ihrer Rechner einem Desktop Grid zur Verfugung zu stellen, durchstose der entstehende virtuelle Supercomputer bereits heute die Exascale-Schwelle, die von konventionellen Supercomputern voraussichtlich erst um das Jahr 2020 erreicht werden wird. Das volle Potential des Desktop Grid Computing wird bislang aber auch bezuglich der Anwendungsunterstutzung noch nicht realisiert. Aufgrund ihres zentralisierten Aufbaus eignen sich aktuelle Desktop Grids lediglich fur sehr einfache parallele Anwendungen. Durch die Nutzung von Konzepten aus dem Peer-to-Peer Computing konnte die Anwendbarkeit des Ansatzes auf nicht-triviale Anwendungen aus dem Hochleistungsrechnen ausgeweitet werden. Dazu gehoren Suchprobleme, wie die diskrete Optimierung, das Bedingungserfullungsproblem, und das Erfullbarkeitsproblem, aber auch Raytracing und N-Korper-Simulationen. Alle diese Anwendungen gehoren zur Klasse der Irregular-Strukturierten Probleme (ISP). Sie zeichnen sich durch stark eingabeabhangige, unstrukturierte und sich uber die Zeit verandernde Verarbeitungs- und Interaktionsmuster aus. Der Einsatz von Peer-to-Peer Mechanismen hat Einfluss auf zahlreiche Aspekte einer Desktop Grid Computing Plattform: Die Architektur muss dezentralisiert werden und eine sichere Ausfuhrung von Anwendungen in einem Umfeld erlauben, das nicht von einer einzigen vertrauenswurdigen Authoritat kontrolliert wird. Die Plattform muss auserdem auf Erweiterbarkeit ausgelegt sein, um die Vielzahl unterschiedlicher spezialisierter verteilter Algorithmen jenseits des Client/Server Paradigmas zu unterstutzen. Um die effiziente Ausfuhrung task-paralleler ISPs zu gewahrleisten, muss die Plattform einen verteilten Taskpool bereitstellen, der es erlaubt Probleme dynamisch zur Laufzeit zu zerlegen, die Teilprobleme innerhalb des Desktop Grids zu verteilen, im Fehlerfall verlorene Tasks wiederherzustellen und schlieslich das Ende der verteilten Berechnung zu erkennen. Dazu ist auf Ebene des Netzwerksubstrates die Verfugbarkeit effizienter Mechanismen fur die Punkt-zu-Punkt und die Gruppenkommunikation von entscheidender Bedeutung. Auserdem muss der Status von Ressourcen bezuglich ihrer Verfugbarkeit effizient und zeitnah kommuniziert werden. All dies ohne die Skalierbarkeit der Plattform zu beeintrachtigen. Cohesion, die in dieser Arbeit beschriebene Desktop Grid Computing Plattform der nachsten Generation, lost diese Herausforderungen durch den kombinierten Einsatz neuer und bewahrter Methoden. Das Potential der Plattform zur Ausfuhrung nicht-trivialer Anwendungen wird anhand eines verteilen Solvers fur das Erfullbarkeitsproblem namens Satciety demonstriert.

[1]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[2]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[3]  G. Amdhal,et al.  Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).

[4]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[5]  Michael J. Flynn,et al.  Some Computer Organizations and Their Effectiveness , 1972, IEEE Transactions on Computers.

[6]  D. L. Parnas,et al.  On the criteria to be used in decomposing systems into modules , 1972, Software Pioneers.

[7]  Gordon E. Moore,et al.  Progress in digital integrated electronics , 1975 .

[8]  Richard A. DeMillo,et al.  On the Computational Complexity of a Generalized Scheduling Problem , 1976, IEEE Transactions on Computers.

[9]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[10]  Daniel Lehmann,et al.  Dynamic systems and their distributed termination , 1982, PODC '82.

[11]  K. Mani Chandy,et al.  Termination Detection of Diffusing Computations in Communicating Sequential Processes , 1982, TOPL.

[12]  Michael Stonebraker,et al.  A Formal Model of Crash Recovery in a Distributed System , 1983, IEEE Transactions on Software Engineering.

[13]  A. J. M. van Gasteren,et al.  Derivation of a Termination Detection Algorithm for Distributed Computations , 1983, Inf. Process. Lett..

[14]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[15]  Willy Zwaenepoel,et al.  Distributed process groups in the V Kernel , 1985, TOCS.

[16]  David Gelernter,et al.  Generative communication in Linda , 1985, TOPL.

[17]  William J. Bolosky,et al.  Mach: A New Kernel Foundation for UNIX Development , 1986, USENIX Summer.

[18]  Ten-Hwang Lai,et al.  Termination Detection for Dynamically Distributed Systems with Non-first-in-first-out Communication , 1986, J. Parallel Distributed Comput..

[19]  Kenneth P. Birman,et al.  Reliable communication in the presence of failures , 1987, TOCS.

[20]  John L. Gustafson,et al.  Reevaluating Amdahl's law , 1988, CACM.

[21]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[22]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[23]  Friedemann Mattern,et al.  Global Quiescence Detection Based on Credit Distribution and Recovery , 1989, Inf. Process. Lett..

[24]  Yuri Gurevich,et al.  Contextual Semantics: From QuantumMechanics to Logic, Databases, Constraints, and Complexity , 2014 .

[25]  Paul G. Spirakis,et al.  Efficient robust parallel computations , 2018, STOC '90.

[26]  Fred B. Schneider,et al.  Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.

[27]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[28]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[29]  Matt W. Mutka.  Estimating Capacity For Sharing in a Privately Owned Workstation Environment , 1992, IEEE Trans. Software Eng..

[30]  Kenneth P. Birman,et al.  The process group approach to reliable distributed computing , 1992, CACM.

[31]  Neil J. Gunther.  A Simple Capacity Model of Massively Parallel Transaction Systems , 1993, Int. CMG Conference.

[32]  Feng Luo,et al.  Exploring the k-colorable landscape with Iterated Greedy , 1993, Cliques, Coloring, and Satisfiability.

[33]  James M. Crawford,et al.  Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems , 1994, AAAI.

[34]  Douglas C. Schmidt,et al.  Reactor: an object behavioral pattern for concurrent event demultiplexing and event handler dispatching , 1995 .

[35]  ZHANGLi-xia,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995 .

[36]  Ali R. Hurson,et al.  Scheduling and Load Balancing in Parallel and Distributed Systems , 1995 .

[37]  Yechiam Yemini,et al.  Distributed management by delegation , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[38]  Miron Livny,et al.  A worldwide flock of Condors: Load sharing among workstation clusters , 1996, Future Gener. Comput. Syst..

[39]  Peter S. Pacheco.  Parallel programming with MPI , 1996 .

[40]  Maria Paola Bonacina,et al.  PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems , 1996, J. Symb. Comput..

[41]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[42]  Eric A. Brewer,et al.  ATLAS: an infrastructure for global computing , 1996, EW 7.

[43]  Francis C. M. Lau,et al.  Efficient Termination Detection for Loosely Synchronous Applications in Multicomputers , 1996, IEEE Trans. Parallel Distributed Syst..

[44]  Bradley C. Kuszmaul,et al.  Cilk: an efficient multithreaded runtime system , 1995, PPOPP '95.

[45]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[46]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[47]  Dhananjay M. Dhamdhere,et al.  Distributed Termination Detection for Dynamic Systems , 1997, Parallel Comput..

[48]  Robert D. Blumofe,et al.  Adaptive and Reliable ParallelComputing9 Networks of Workstations , 1997 .

[49]  Bart Selman,et al.  Heavy-Tailed Distributions in Combinatorial Search , 1997, CP.

[50]  Deborah Estrin,et al.  Error recovery in scalable reliable multicast , 1997 .

[51]  Rico Piantoni,et al.  Implementing the Swiss Exchange trading system , 1997, Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing.

[52]  David Salomon,et al.  Data Compression: The Complete Reference , 2006 .

[53]  Matthew Thomas Lucas,et al.  Efficient data distribution in large-scale multicast networks , 1998 .

[54]  L. Alvisi,et al.  Message Logging: Pessimistic, Optimistic, Causal, and Optimal , 1998, IEEE Trans. Software Eng..

[55]  Luis F. G. Sarmenta,et al.  Bayanihan: Web-Based Volunteer Computing Using Java , 1998, WWCA.

[56]  Wolfgang Küchlin,et al.  The Distributed Object-Oriented Threads System DOTS , 1998, IRREGULAR.

[57]  Tracy Camp,et al.  A taxonomy of distributed termination detection algorithms , 1998, J. Syst. Softw..

[58]  Leslie Lamport,et al.  The part-time parliament , 1998, TOCS.

[59]  Michael Litzkow,et al.  Supporting checkpointing and process migration outside the UNIX kernel , 1999 .

[60]  C. Leiserson,et al.  Scheduling multithreaded computations by work stealing , 1999, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[61]  Sheng Liang,et al.  Java Native Interface: Programmer's Guide and Specification , 1999 .

[62]  Li Gong,et al.  Inside Java 2 Platform Security: Architecture, API Design, and Implementation , 1999 .

[63]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[64]  Luis F. G. Sarmenta.  An Adaptive, Fault-Tolerant Implementation of BSP for JAVA-Based Volunteer Computing Systems , 1999, IPPS/SPDP Workshops.

[65]  R. Wolski,et al.  Predicting the CPU availability of time‐shared Unix systems on the computational grid , 1999, Proceedings. The Eighth International Symposium on High Performance Distributed Computing (Cat. No.99TH8469).

[66]  Satoshi Hirano,et al.  Bayanihan: building and studying web-based volunteer computing systems using Java , 1999, Future Gener. Comput. Syst..

[67]  Rajesh Raman,et al.  Resource management through multilateral matchmaking , 2000, Proceedings the Ninth International Symposium on High-Performance Distributed Computing.

[68]  Joao Marques-Silva,et al.  Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability , 2000, CP.

[69]  P. D. Hough,et al.  Algorithm-dependent fault tolerance for distributed computing , 2000 .

[70]  Noam Nisan,et al.  The POPCORN market. Online markets for computational resources , 2000, Decis. Support Syst..

[71]  Kenneth P. Birman,et al.  Throughput Stability of Reliable Multicast Protocols , 2000, ADVIS.

[72]  Spyros Lalis,et al.  JaWS: An Open Market-Based Framework for Distributed Computing over the Internet , 2000, GRID.

[73]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[74]  M. Moskewicz,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[75]  Rajkumar Buyya,et al.  Compute Power Market: towards a market-oriented grid , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[76]  Bart Selman,et al.  Algorithm portfolios , 2001, Artif. Intell..

[77]  Michael Kaufmann,et al.  yFiles - Visualization and Automatic Layout of Graphs , 2001, Graph Drawing Software.

[78]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[79]  Anne-Marie Kermarrec,et al.  SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication , 2001, Networked Group Communication.

[80]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[81]  Antony I. T. Rowstron,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.

[82]  Rüdiger Schollmeier,et al.  A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications , 2001, Proceedings First International Conference on Peer-to-Peer Computing.

[83]  Henri E. Bal,et al.  Efficient load balancing for wide-area divide-and-conquer applications , 2001, PPoPP '01.

[84]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[85]  Ian T. Foster,et al.  The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[86]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[87]  Carsten Sinz,et al.  Distributed Parallel SAT Checking with Dynamic Learning using DOTS , 2001 .

[88]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[89]  Miguel Castro,et al.  Scribe: a large-scale and decentralized application-level multicast infrastructure , 2002, IEEE J. Sel. Areas Commun..

[90]  Greg Ruetsch,et al.  Framework for Peer-to-Peer Distributed Computing in a Heterogeneous, Decentralized Environment , 2002, GRID.

[91]  David P. Anderson,et al.  SETI@home: an experiment in public-resource computing , 2002, CACM.

[92]  Peter R. Cappello,et al.  CX: A scalable, robust network for parallel computing , 2002, Sci. Program..

[93]  Steven Tuecke,et al.  The Physiology of the Grid An Open Grid Services Architecture for Distributed Systems Integration , 2002 .

[94]  Bobby Bhattacharjee,et al.  Scalable application layer multicast , 2002, SIGCOMM 2002.

[95]  Gideon Stupp,et al.  Stateless Termination Detection , 2002, DISC.

[96]  Hein Meling,et al.  Messor: Load-Balancing through a Swarm of Autonomous Agents , 2002, AP2PC.

[97]  Nancy A. Lynch,et al.  Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services , 2002, SIGA.

[98]  Sharad Malik,et al.  The Quest for Efficient Boolean Satisfiability Solvers , 2002, CAV.

[99]  Paul Roe,et al.  G2: A Grid Middleware for Cycle Donation Using .NET , 2002, PDPTA.

[100]  Wolfgang Küchlin,et al.  The Design of an API for Strict Multithreading in C++ , 2003, Euro-Par.

[101]  Randal E. Bryant,et al.  Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors , 2003, J. Symb. Comput..

[102]  Huaimin Wang,et al.  A P2P approach for global computing , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[103]  Anne-Marie Kermarrec,et al.  Peer-to-Peer Membership Management for Gossip-Based Protocols , 2003, IEEE Trans. Computers.

[104]  Farid Ould-Saada,et al.  The NorduGrid Architecture and Middleware for Scientific Applications , 2003, International Conference on Computational Science.

[105]  Robbert van Renesse.  The Importance of Aggregation , 2003, Future Directions in Distributed Computing.

[106]  Wolfgang Küchlin,et al.  Parallel propositional satisfiability checking with distributed dynamic learning , 2003, Parallel Comput..

[107]  Stefan Savage,et al.  Understanding Availability , 2003, IPTPS.

[108]  Bill Yeager,et al.  Project JXTA 2.0 Super-Peer Virtual Network , 2003 .

[109]  David Stutz,et al.  Shared source CLI essentials , 2003 .

[110]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[111]  Ralph Deters,et al.  The costs of using JXTA , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[112]  Francisco Vilar Brasileiro,et al.  Trading Cycles for Information: Using Replication to Schedule Bag-of-Tasks Applications on Computational Grids , 2003, Euro-Par.

[113]  Cho-Li Wang,et al.  Solving irregularly structured problems based on distributed object model , 2003, Parallel Comput..

[114]  Robbert van Renesse,et al.  Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining , 2003, TOCS.

[115]  Bo Hong,et al.  Managing flash crowds on the Internet , 2003, 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003..

[116]  Larry Carter,et al.  Autonomous protocols for bandwidth-centric scheduling of independent-task applications , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[117]  Laurent Daynès,et al.  A Multi-User Virtual Machine , 2003, USENIX Annual Technical Conference, General Track.

[118]  Wolfgang Küchlin,et al.  A Universal Parallel SAT Checking Kernel , 2003, PDPTA.

[119]  Andrew A. Chien,et al.  Entropia: architecture and performance of an enterprise desktop grid system , 2003, J. Parallel Distributed Comput..

[120]  Y. Charlie Hu,et al.  A Self-Organizing Flock of Condors , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[121]  Márk Jelasity,et al.  A Robust and Scalable Peer-to-Peer Gossiping Protocol , 2003, AP2PC.

[122]  Cyrus Harrison,et al.  OCEAN: the open computation exchange and arbitration network, a market approach to meta computing , 2003, Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings..

[123]  David E. Culler,et al.  PlanetLab: an overlay testbed for broad-coverage services , 2003, CCRV.

[124]  Fahiem Bacchus,et al.  Effective Preprocessing with Hyper-Resolution and Equality Reduction , 2003, SAT.

[125]  R. Wolski,et al.  GridSAT: A Chaff-based Distributed SAT Solver for the Grid , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[126]  Ian Stokes-Rees,et al.  DIRAC: a scalable lightweight architecture for high throughput computing , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[127]  Praveen Yalagandula,et al.  A scalable distributed information management system , 2004, SIGCOMM 2004.

[128]  Sathya Peri,et al.  Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies , 2004, DISC.

[129]  V. Vinay,et al.  Branching rules for satisfiability , 1995, Journal of Automated Reasoning.

[130]  Peter Saint-Andre,et al.  End-to-End Signing and Object Encryption for the Extensible Messaging and Presence Protocol (XMPP) , 2004, RFC.

[131]  Fabio Massacci,et al.  Logical Cryptanalysis as a SAT Problem , 2000, Journal of Automated Reasoning.

[132]  Peter Saint-Andre,et al.  Extensible Messaging and Presence Protocol (XMPP): Instant Messaging and Presence , 2004, RFC.

[133]  I. Stoica,et al.  Internet indirection infrastructure , 2002, SIGCOMM '02.

[134]  Emil C. Lupu,et al.  A role based framework for distributed systems management , 1998 .

[135]  Julien Bourgeois,et al.  Using Similarity Groups to Increase Performance of P2P Computing , 2004, Euro-Par.

[136]  Igor L. Markov,et al.  Breaking instance-independent symmetries in exact graph coloring , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.

[137]  Daniel Zappala,et al.  Cluster Computing on the Fly : P 2 P Scheduling of Idle Cycles in the Internet , 2004 .

[138]  Márk Jelasity,et al.  Robust aggregation protocols for large-scale overlay networks , 2004, International Conference on Dependable Systems and Networks, 2004.

[139]  Rudolf Bayer,et al.  Symmetric binary B-Trees: Data structure and maintenance algorithms , 1972, Acta Informatica.

[140]  David E. Culler,et al.  The ganglia distributed monitoring system: design, implementation, and experience , 2004, Parallel Comput..

[141]  Simin Nadjm-Tehrani,et al.  Scale-up and performance studies of three agent platforms , 2004, IEEE International Conference on Performance, Computing, and Communications, 2004.

[142]  Andrew A. Chien,et al.  Henri Casanova , 2022 .

[143]  Andrew A. Chien,et al.  Resource management in the entropia system , 2004 .

[144]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[145]  Robert Tappan Morris,et al.  Practical, distributed network coordinates , 2004, Comput. Commun. Rev..

[146]  Erik DeBenedictis,et al.  Reversible logic for supercomputing , 2005, CF '05.

[147]  Friedemann Mattern,et al.  Algorithms for distributed termination detection , 1987, Distributed Computing.

[148]  Thomas Hérault,et al.  Computing on large-scale distributed systems: XtremWeb architecture, programming models, security, tests and convergence with grid , 2005, Future Gener. Comput. Syst..

[149]  Denis Caromel,et al.  Balancing active objects on a peer to peer infrastructure , 2005, XXV International Conference of the Chilean Computer Science Society (SCCC'05).

[150]  Lars Bengtsson,et al.  Jalapeno: secentralized grid computing using peer-to-peer technology , 2005, CF '05.

[151]  Gil Utard,et al.  A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers , 2005, Journal of Automated Reasoning.

[152]  Nachum Dershowitz,et al.  Parallel Multithreaded Satisfiability Solver: Design and Implementation , 2005, PDMC.

[153]  I. Wang.  P2PS (Peer-to-Peer Simpli ed) , 2005 .

[154]  O NearyMichael,et al.  Advanced eager scheduling for Java-based adaptive parallel computing , 2005 .

[155]  Armin Biere,et al.  Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

[156]  Philip J. Hatcher,et al.  Performance evaluation of JXTA communication layers , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[157]  Rajkumar Buyya,et al.  Alchemi: A .NET-based Enterprise Grid Computing System , 2005, International Conference on Internet Computing.

[158]  Nabil Abdennadher,et al.  Towards a peer-to-peer platform for high performance computing , 2005, Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05).

[159]  Bogdan M. Wilamowski,et al.  The Transmission Control Protocol , 2005, The Industrial Information Technology Handbook.

[160]  David G. Mitchell,et al.  A SAT Solver Primer , 2005, Bull. EATCS.

[161]  H. Peter Hofstee,et al.  Introduction to the Cell multiprocessor , 2005, IBM J. Res. Dev..

[162]  Wolfgang Küchlin,et al.  ZetaSAT - Boolean SATisfiability solving on Desktop Grids , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[163]  Jason Maassen,et al.  Fault-tolerance, malleability and migration for divide-and-conquer applications on the grid , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[164]  Daniel H. Steinberg,et al.  Zero Configuration Networking: The Definitive Guide , 2005 .

[165]  Alain Vagner,et al.  Parallel Resolution of the Satisfiability Problem (SAT) with OpenMP and MPI , 2005, PPAM.

[166]  Grzegorz Czajkowski,et al.  A resource management interface for the Java™ platform , 2005, Softw. Pract. Exp..

[167]  Ewald Speckenmeyer,et al.  A fast parallel SAT-solver — efficient workload balancing , 2005, Annals of Mathematics and Artificial Intelligence.

[168]  Wayne Kelly,et al.  G2-P2P: A Fully Decentralised Fault-Tolerant Cycle-Stealing Framework , 2005, ACSW.

[169]  Kazuyuki Shudo,et al.  P3: P2P-based middleware enabling transfer and aggregation of computational resources , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[170]  Ilkka Niemelä,et al.  A Distribution Method for Solving SAT in Grids , 2006, SAT.

[171]  Richard Wolski,et al.  GridSAT: Design and Implementation of a Computational Grid Application , 2006, Journal of Grid Computing.

[172]  Tim Moors,et al.  Survey of Research towards Robust Peer-to-Peer Networks: Search Methods , 2007, RFC.

[173]  Jem Treadwell,et al.  Open Grid Services Architecture , 2006, Grid-Based Problem Solving Environments.

[174]  Mario Lauria,et al.  Self-Organizing Scheduling on the Organic Grid , 2006, Int. J. High Perform. Comput. Appl..

[175]  Ian T. Foster,et al.  Globus Toolkit Version 4: Software for Service-Oriented Systems , 2005, Journal of Computer Science and Technology.

[176]  河野 健二.  20世紀の名著名論:M. Accetta R. Baron W. Bolosky D. Golub R. Rashid A. Tevanian and M. Young：Mach : A New Kernel Foundation For UNIX Development , 2006 .

[177]  Francisco Vilar Brasileiro,et al.  Sandboxing for a free-to-join grid with support for secure site-wide storage area , 2006, First International Workshop on Virtualization Technology in Distributed Computing (VTDC 2006).

[178]  Chong-Sun Hwang,et al.  Adaptive group scheduling mechanism using mobile agents in peer-to-peer grid computing environment , 2006, Applied Intelligence.

[179]  Richard Wolski,et al.  GridSAT: a system for solving satisfiability problems using a computational grid , 2006, Parallel Comput..

[180]  Stéphane Genaud,et al.  P2P-MPI: A Peer-to-Peer Framework for Robust Execution of Message Passing Parallel Programs on Grids , 2007, Journal of Grid Computing.

[181]  Francisco Vilar Brasileiro,et al.  A Case for Event-Driven Distributed Objects , 2006, OTM Conferences.

[182]  Wolfgang Blochinger,et al.  Aspect-Oriented Parallel Discrete Optimization on the Cohesion Desktop Grid Platform , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[183]  Franck Cappello,et al.  Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid Testbed , 2006, Int. J. High Perform. Comput. Appl..

[184]  Stéphane Frénot,et al.  Virtualization of Service Gateways in Multi-provider Environments , 2006, CBSE.

[185]  Peter Merz,et al.  A Middleware for Job Distribution in Peer-to-Peer Networks , 2006, PARA.

[186]  Virginia Mary Lo,et al.  WaveGrid: a scalable fast-turnaround heterogeneous peer-based desktop grid system , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[187]  Angela Orebaugh,et al.  Wireshark & Ethereal Network Protocol Analyzer Toolkit (Jay Beale's Open Source Security) , 2006 .

[188]  Anbu Anbulagan,et al.  Multiple preprocessing for systematic SAT solvers , 2006 .

[189]  Denis Caromel,et al.  ProActive: an integrated platform for programming and running applications on Grids and P2P systems , 2006 .

[190]  Bobby Bhattacharjee,et al.  Using content-addressable networks for load balancing in desktop grids , 2007, HPDC '07.

[191]  Rajkumar Buyya,et al.  Aneka: Next-Generation Enterprise Grid Platform for e-Science and e-Business Applications , 2007, Third IEEE International Conference on e-Science and Grid Computing (e-Science 2007).

[192]  Denis Caromel,et al.  Peer-to-peer for computational grids: mixing clusters and desktop machines , 2007, Parallel Comput..

[193]  Gustavo Alonso,et al.  R-OSGi: Distributed Applications Through Software Modularization , 2007, Middleware.

[194]  Francisco Vilar Brasileiro,et al.  Bridging the High Performance Computing Gap: the OurGrid Experience , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[195]  Bernhard Thomaszewski,et al.  Physically based simulation of cloth on distributed memory architectures , 2007, Parallel Comput..

[196]  Rajkumar Buyya,et al.  A Taxonomy of Desktop Grids and its Mapping to State-ofthe-Art Systems , 2007 .

[197]  Richard Wolski,et al.  An Analysis of Availability Distributions in Condor , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[198]  Abdel Ejnioui,et al.  Tiered Algorithm for Distributed Process Quiescence and Termination Detection , 2007, IEEE Transactions on Parallel and Distributed Systems.

[199]  P. Oscar Boykin,et al.  A Symphony Conducted by Brunet , 2007, ArXiv.

[200]  Ian J. Taylor,et al.  Peer-To-Peer Techniques for Data Distribution in Desktop Grid Computing Platforms , 2007, CoreGRID Workshop - Making Grids Work.

[201]  Mathieu Jan,et al.  Performance scalability of the JXTA P2P framework , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[202]  Wolfgang Blochinger,et al.  An Integrated Approach for Managing Peer-to-Peer Desktop Grid Systems , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[203]  Jinbo Huang,et al.  The Effect of Restarts on the Efficiency of Clause Learning , 2007, IJCAI.

[204]  Bobby Bhattacharjee,et al.  Creating a Robust Desktop Grid using Peer-to-Peer Services , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[205]  Konstantinos Psounis,et al.  Performance analysis of BitTorrent-like systems with heterogeneous users , 2007, Performance evaluation (Print).

[206]  Bernd Becker,et al.  Multithreaded SAT Solving , 2007, 2007 Asia and South Pacific Design Automation Conference.

[207]  Dennis Schwerdel,et al.  A Self-Organizing Super-Peer Overlay with a Chord Core for Desktop Grids , 2008, IWSOS.

[208]  R Day,et al.  The eclipse open-development platform , 2008 .

[209]  Herb Sutter,et al.  A Fundamental Turn Toward Concurrency in Software , 2008 .

[210]  Wolfgang Blochinger,et al.  COHESION - A microkernel based Desktop Grid platform for irregular task-parallel applications , 2008, Future Gener. Comput. Syst..

[211]  Heithem Abbes,et al.  Analysis of Peer-to-Peer Protocols Performance for Establishing a Decentralized Desktop Grid Middleware , 2008, Euro-Par Workshops.

[212]  Walter Binder,et al.  Program transformations for light-weight CPU accounting and control in the Java virtual machine , 2008, High. Order Symb. Comput..

[213]  Wolfgang Blochinger,et al.  Capability-Aware Information Aggregation in Peer-to-Peer Grids , 2009, Journal of Grid Computing.

[214]  S. Borkar,et al.  An 80-Tile Sub-100-W TeraFLOPS Processor in 65-nm CMOS , 2008, IEEE Journal of Solid-State Circuits.

[215]  Lakhdar Sais,et al.  Vivifying Propositional Clausal Formulae , 2008, ECAI.

[216]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions (Art of Computer Programming) , 2008 .

[217]  Bertil Folliot,et al.  Towards a new isolation abstraction for OSGi , 2008, IIES '08.

[218]  Kevin Leyton-Brown,et al.  SATzilla: Portfolio-based Algorithm Selection for SAT , 2008, J. Artif. Intell. Res..

[219]  Armin Biere.  Adaptive Restart Strategies for Conflict Driven SAT Solvers , 2008, SAT.

[220]  Benjamin Reed,et al.  A simple totally ordered broadcast protocol , 2008, LADIS '08.

[221]  Ilkka Niemelä,et al.  Incorporating Learning in Grid-Based Randomized SAT Solving , 2008, AIMSA.

[222]  F. Cappello,et al.  BitDew: A programmable environment for large-scale data management and distribution , 2008, 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis.

[223]  Gábor Terstyánszky,et al.  EDGeS: A Bridge between Desktop Grids and Service Grids , 2008, The Third ChinaGrid Annual Conference (chinagrid 2008).

[224]  Ulrich Norbisrath,et al.  Friend-to-Friend Computing - Instant Messaging Based Spontaneous Desktop Grid , 2008, 2008 Third International Conference on Internet and Web Applications and Services.

[225]  Stéphane Frénot,et al.  I-JVM: a Java Virtual Machine for component isolation in OSGi , 2009, 2009 IEEE/IFIP International Conference on Dependable Systems & Networks.

[226]  Tobias Wegner.  A Secure Multi-Provider OSGi Platform Enabling Process-Isolation by Using Distribution , 2009, Security and Management.

[227]  Franck Cappello,et al.  Toward Exascale Resilience , 2009, Int. J. High Perform. Comput. Appl..

[228]  Luiz Angelo Steffenel,et al.  CONFIIT: a middleware for peer-to-peer computing , 2009, The Journal of Supercomputing.

[229]  Gustavo Alonso,et al.  Engineering the cloud from software modules , 2009, 2009 ICSE Workshop on Software Engineering Challenges of Cloud Computing.

[230]  Jaspal Subhlok,et al.  VolpexMPI: An MPI Library for Execution of Parallel Applications on Volatile Nodes , 2009, PVM/MPI.

[231]  Domenico Talia,et al.  A scalable super-peer approach for public scientific computation , 2009, Future Gener. Comput. Syst..

[232]  Mohamed Jemni,et al.  BonjourGrid: Orchestration of multi-instances of grid middlewares on institutional Desktop Grids , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[233]  Emmanuel Jeannot,et al.  Fault-Management in P2P-MPI , 2009, International Journal of Parallel Programming.

[234]  Lucas Bordeaux,et al.  Experiments with Massively Parallel Constraint Solving , 2009, IJCAI.

[235]  A. Hyvärinen.  Hyvärinen Approaches to Grid-Based SAT Solving , 2009 .

[236]  Antti E. J. Hyvärinen.  Approaches to grid-based SAT solving , 2009 .

[237]  Péter Kacsuk,et al.  SZTAKI Desktop Grid (SZDG): A Flexible and Scalable Desktop Grid System , 2009, Journal of Grid Computing.

[238]  Marcos José Santana,et al.  Grid Anywhere: An Architecture for Grid Computing Able to Explore the Computational Resources of the Set-Top Boxes , 2009, GridNets.

[239]  Feng Yang,et al.  PPVC: A P2P volunteer computing system , 2009, 2009 2nd IEEE International Conference on Computer Science and Information Technology.

[240]  Dexter H. Hu,et al.  Gossip-based Dynamic Load Balancing in a Self-organized Desktop Grid , 2009 .

[241]  Kiev Gama,et al.  Towards Dynamic Component Isolation in a Service Oriented Platform , 2009, CBSE.

[242]  Wolfgang Blochinger,et al.  A Network Substrate for Peer-to-Peer Grid Computing beyond Embarrassingly Parallel Applications , 2009, 2009 WRI International Conference on Communications and Mobile Computing.

[243]  Bernd Becker,et al.  PaMiraXT: Parallel SAT Solving with Threads and Message Passing , 2009, J. Satisf. Boolean Model. Comput..

[244]  Lakhdar Sais,et al.  ManySAT: a Parallel SAT Solver , 2009, J. Satisf. Boolean Model. Comput..

[245]  Aaron Harwood,et al.  P2P-Tuple: Towards a Robust Volunteer Computing Platform , 2009, 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies.

[246]  Lakhdar Sais,et al.  Control-Based Clause Sharing in Parallel SAT Solving , 2009, IJCAI.

[247]  Mohamed Jemni,et al.  A decentralized and fault‐tolerant Desktop Grid system for distributed applications , 2010, Concurr. Comput. Pract. Exp..

[248]  Julia L. Lawall,et al.  VMKit: a substrate for managed runtime environments , 2010, VEE '10.

[249]  Christoph P. Mayer,et al.  On Runtime Adaptation of Application-Layer Multicast Protocol Parameters , 2010, EUNICE.

[250]  Xiaolin Li,et al.  A taxonomy of peer-to-peer desktop grid paradigms , 2011, Cluster Computing.

[251]  Wolfgang Blochinger,et al.  Parallel SAT Solving on Peer-to-Peer Desktop Grids , 2010, 2010 International Conference on High Performance Computing & Simulation.

[252]  Péter Kacsuk,et al.  Interoperability of BOINC and EGEE , 2010, Future Gener. Comput. Syst..

[253]  Jaspal Subhlok,et al.  A High-Level Interpreted MPI Library for Parallel Computing in Volunteer Environments , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

[254]  Srinath Perera,et al.  Multi-tenant SOA Middleware for Cloud Computing , 2010, 2010 IEEE 3rd International Conference on Cloud Computing.

[255]  Martina Zitterbart,et al.  Reconnecting the internet with ariba: self-organizing provisioning of end-to-end connectivity in heterogeneous networks , 2010, CCRV.

[256]  Henri E. Bal,et al.  Satin: A high-level and efficient grid programming model , 2010, TOPL.

[257]  Wolfgang Blochinger,et al.  Cooperate and compete! A hybrid solving strategy for task-parallel SAT solving on Peer-to-Peer Desktop Grids , 2010, HPCS.

[258]  Cosimo Anglano,et al.  The ShareGrid Peer-to-Peer Desktop Grid: Infrastructure, Applications, and Performance Evaluation , 2010, Journal of Grid Computing.

[259]  Walid Saad,et al.  Fault tolerance based on the publish-subscribe paradigm for the BonjourGrid middleware , 2010, 2010 11th IEEE/ACM International Conference on Grid Computing.

[260]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[261]  Armin Biere,et al.  Blocked Clause Elimination , 2010, TACAS.

[262]  Kiev Gama,et al.  A Self-healing Component Sandbox for Untrustworthy Third Party Code Execution , 2010, CBSE.

[263]  Marco Aurélio Spohn,et al.  Ad hoc Grid: An Adaptive and Self-Organizing Peer-to-Peer Computing Grid , 2010, 2010 10th IEEE International Conference on Computer and Information Technology.

[264]  Mohamed Jemni,et al.  Fault-tolerance for PastryGrid middleware , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW).

[265]  T. Kielmann,et al.  Real-world Distributed Computing with Ibis , 2010 .

[266]  Luiz Angelo Steffenel,et al.  Deploying a fault-tolerant computing middleware over Grid'5000: performance analysis of CONFIIT and its integration with a quantum molecular docking application , 2011 .

[267]  Christoph P. Mayer,et al.  SpoVNet: An Architecture for Easy Creation and Deployment of Service Overlays , 2011 .

[268]  Wolfgang Blochinger,et al.  Adjustable Module Isolation for Distributed Computing Infrastructures , 2011, 2011 IEEE/ACM 12th International Conference on Grid Computing.

[269]  Peter Saint-Andre.  Extensible Messaging and Presence Protocol (XMPP): Core , 2011, RFC.

[270]  John Shalf,et al.  The International Exascale Software Project roadmap , 2011, Int. J. High Perform. Comput. Appl..

[271]  A Taxonomy for Desktop Grids from Users ’ Perspective , 2022 .

[272]  Zaher S. Andraus,et al.  Advances and Insights into Parallel SAT Solving , .