Gagan Agrawal Gabrielle Allen Gustavo Alonso Phil Andrews Cosimo Anglano Gabriel Antoniu Manish A... more Gagan Agrawal Gabrielle Allen Gustavo Alonso Phil Andrews Cosimo Anglano Gabriel Antoniu Manish Arora Laurent Baduel Joseph Bianco Rupak Biswas Todd Bryan Philip Buonadonna Henri Casanova DeQing Chen Kenneth Chiu Wahid Chrabakh Pérez Christian Morin Christine Brent Chun Giuseppe Ciaccio Arnaud Contes Balázs Csizmazia Steve Cutchin Karl Czajkowski Alexandre Denis Thomas Dramlitsch Torsten Fink Michail Flouris Brent Gorda Sergei Gorlatch ... Madhusudhan Govindaraju Ananth Grama Jerry Greenberg Anshul Gupta Daniel ...
We present the latest instantiation of GridSAT [1], a distributed and complete satisfiability sol... more We present the latest instantiation of GridSAT [1], a distributed and complete satisfiability solver that is explicitly designed to aggregate Grid resources for application performance. GridSAT was previously shown to outperform the state-of-the-art sequential solvers. In this work, we explore the unprecedented solving power GridSAT enables through algorithmic and implementation innovations. We describe the implementation techniques that allow GridSAT to
Grid Computing is an emerging field in computer science. Research in this area aims at aggregatin... more Grid Computing is an emerging field in computer science. Research in this area aims at aggregating distributed, heterogenous and federated resources and make it available to Grid applications. In the past two types of applications have been deployed with varying degrees of success. The first type of applications is embarrassingly parallel (a bag of independent tasks). This category adapts well to a computational grid environment. The second category of applications includes mainly scientific code which is tightly coupled in nature. This type of applications is very hard to deploy in a grid environment. In this thesis we present GridSAT, a new grid application. GridSAT is a distributed complete Boolean satisfiability sower based on the sequential solver Chaff [70]. In addition to its theoretical significance, the satisfiability problem has numerous practical applications. SAT solvers are used in many engineering and scientific fields including circuit design and model checking. GridS...
We present the latest instantiation of GridSAT (5), a distributed and complete satisfiability sol... more We present the latest instantiation of GridSAT (5), a distributed and complete satisfiability solver that is explicitly designed to aggregate grid resources for application performance. GridSAT was previously shown to outperform the state-of-the-art sequential solvers. In this work, we explore the unprecedented solving power GridSAT enables through algorithmic and implementation innovations. We describe the implementation techniques that allow GridSAT to
We present the latest instantiation of GridSAT [1], a distributed and complete satisfiability sol... more We present the latest instantiation of GridSAT [1], a distributed and complete satisfiability solver that is explicitly designed to aggregate Grid resources for application performance. GridSAT was previously shown to outperform the state-of-the-art sequential solvers. In this work, we explore the unprecedented solving power GridSAT enables through algorithmic and implementation innovations. We describe the implementation techniques that allow GridSAT to
Gagan Agrawal Gabrielle Allen Gustavo Alonso Phil Andrews Cosimo Anglano Gabriel Antoniu Manish A... more Gagan Agrawal Gabrielle Allen Gustavo Alonso Phil Andrews Cosimo Anglano Gabriel Antoniu Manish Arora Laurent Baduel Joseph Bianco Rupak Biswas Todd Bryan Philip Buonadonna Henri Casanova DeQing Chen Kenneth Chiu Wahid Chrabakh Pérez Christian Morin Christine Brent Chun Giuseppe Ciaccio Arnaud Contes Balázs Csizmazia Steve Cutchin Karl Czajkowski Alexandre Denis Thomas Dramlitsch Torsten Fink Michail Flouris Brent Gorda Sergei Gorlatch ... Madhusudhan Govindaraju Ananth Grama Jerry Greenberg Anshul Gupta Daniel ...
We present the latest instantiation of GridSAT [1], a distributed and complete satisfiability sol... more We present the latest instantiation of GridSAT [1], a distributed and complete satisfiability solver that is explicitly designed to aggregate Grid resources for application performance. GridSAT was previously shown to outperform the state-of-the-art sequential solvers. In this work, we explore the unprecedented solving power GridSAT enables through algorithmic and implementation innovations. We describe the implementation techniques that allow GridSAT to
Grid Computing is an emerging field in computer science. Research in this area aims at aggregatin... more Grid Computing is an emerging field in computer science. Research in this area aims at aggregating distributed, heterogenous and federated resources and make it available to Grid applications. In the past two types of applications have been deployed with varying degrees of success. The first type of applications is embarrassingly parallel (a bag of independent tasks). This category adapts well to a computational grid environment. The second category of applications includes mainly scientific code which is tightly coupled in nature. This type of applications is very hard to deploy in a grid environment. In this thesis we present GridSAT, a new grid application. GridSAT is a distributed complete Boolean satisfiability sower based on the sequential solver Chaff [70]. In addition to its theoretical significance, the satisfiability problem has numerous practical applications. SAT solvers are used in many engineering and scientific fields including circuit design and model checking. GridS...
We present the latest instantiation of GridSAT (5), a distributed and complete satisfiability sol... more We present the latest instantiation of GridSAT (5), a distributed and complete satisfiability solver that is explicitly designed to aggregate grid resources for application performance. GridSAT was previously shown to outperform the state-of-the-art sequential solvers. In this work, we explore the unprecedented solving power GridSAT enables through algorithmic and implementation innovations. We describe the implementation techniques that allow GridSAT to
We present the latest instantiation of GridSAT [1], a distributed and complete satisfiability sol... more We present the latest instantiation of GridSAT [1], a distributed and complete satisfiability solver that is explicitly designed to aggregate Grid resources for application performance. GridSAT was previously shown to outperform the state-of-the-art sequential solvers. In this work, we explore the unprecedented solving power GridSAT enables through algorithmic and implementation innovations. We describe the implementation techniques that allow GridSAT to
Uploads
Papers by Wahid Chrabakh