@article{journals/sp/IosupTFEL08, title = {Inter-operating grids through Delegated MatchMaking.}, author = {Alexandru Iosup and Todd Tannenbaum and Matthew Farrellee and Dick H. J. Epema and Miron Livny}, journal = {Scientific Programming}, number = {2-3}, pages = {233-253}, url = {http://dblp.uni-trier.de/db/journals/sp/sp16.html#IosupTFEL08}, volume = {16}, year = {2008}, biburl = {http://www.bibsonomy.org/bibtex/255f3fe7015d5383cb9d5f5a72fdd0d8a/dblp}, description = {dblp}, ee = {http://dx.doi.org/10.3233/SPR-2008-0246}, date = {2008-11-19}, keywords = {dblp } } @inproceedings{conf/sc/DeelmanSLBG08, title = {The cost of doing science on the cloud: the Montage example.}, author = {Ewa Deelman and Gurmeet Singh and Miron Livny and J. Bruce Berriman and John Good}, booktitle = {SC}, crossref = {conf/sc/2008}, pages = {50}, publisher = {IEEE/ACM}, url = {http://dblp.uni-trier.de/db/conf/sc/sc2008.html#DeelmanSLBG08}, year = {2008}, biburl = {http://www.bibsonomy.org/bibtex/23254e2ea7b050a63a6f5f876a24d7172/dblp}, description = {dblp}, ee = {http://doi.acm.org/10.1145/1413370.1413421}, isbn = {978-1-4244-2835-9}, date = {2008-11-17}, keywords = {dblp } } @inproceedings{conf/rtss/PangLC92, title = {Transaction Scheduling in Multiclass Real-Time Database Systems.}, author = {HweeHwa Pang and Miron Livny and Michael J. Carey}, booktitle = {IEEE Real-Time Systems Symposium}, pages = {23-34}, url = {http://dblp.uni-trier.de/db/conf/rtss/rtss1992.html#PangLC92}, year = {1992}, biburl = {http://www.bibsonomy.org/bibtex/228f51c7ef15d030373ca6a85622600ae/dblp}, description = {dblp}, ee = {http://dx.doi.org/10.1109/REAL.1992.242679}, date = {2008-09-10}, keywords = {dblp } } @article{journals/vc/LivnyPE08, title = {Interactive GPU-based adaptive cartoon-style rendering.}, author = {Yotam Livny and Michael Press and Jihad El-Sana}, journal = {The Visual Computer}, number = {4}, pages = {239-247}, url = {http://dblp.uni-trier.de/db/journals/vc/vc24.html#LivnyPE08}, volume = {24}, year = {2008}, biburl = {http://www.bibsonomy.org/bibtex/2f462107df31bcdd950fabc8c79891780/dblp}, description = {dblp}, ee = {http://dx.doi.org/10.1007/s00371-007-0201-0}, date = {2008-08-08}, keywords = {dblp } } @article{keyhere, title = {Pegasus: Mapping Scientific Workflows onto the Grid}, author = {Ewa Deelman and James Blythe and Yolanda Gil and Carl Kesselman and Gaurang Mehta and Sonal Patil and Mei-Hui Su and Karan Vahi and Miron Livny}, journal = {Grid Computing}, pages = {11--20}, url = {http://www.springerlink.com/content/95rj5e2fgqqpkaha}, year = {2004}, biburl = {http://www.bibsonomy.org/bibtex/29c38a7c6de2c0c9d9a40ed2fbf5b5b4a/ustun}, description = {SpringerLink - Book Chapter}, abstract = {In this paper we describe the Pegasus system that can map complex workflows onto the Grid. Pegasus takes an abstract description of a workflow and finds the appropriate data and Grid resources to execute the workflow. Pegasus is being released as part of the GriPhyN Virtual Data Toolkit and has been used in a variety of applications ranging from astronomy, biology, gravitational-wave science, and high-energy physics. A deferred planning mode of Pegasus is also introduced. ER -}, keywords = {imported } } @article{journals/ijig/LivnySE07, title = {Dual Adaptive Paths for Multiresolution Hierarchies.}, author = {Yotam Livny and Neta Sokolovsky and Jihad El-Sana}, journal = {Int. J. Image Graphics}, number = {2}, pages = {273-290}, url = {http://dblp.uni-trier.de/db/journals/ijig/ijig7.html#LivnySE07}, volume = {7}, year = {2007}, biburl = {http://www.bibsonomy.org/bibtex/2b25f0c7bb926bc347fbe45797db21da1/dblp}, description = {dblp}, ee = {http://dx.doi.org/10.1142/S0219467807002726}, date = {2008-06-20}, keywords = {dblp } } @inproceedings{globus:2000:jgac, title = {JavaGenes and Condor: Cycle-Scavenging Genetic Algorithms}, address = {San Francisco, California}, author = {Al Globus and Eric Langhirt and Miron Livny and Ravishankar Ramamurthy and Marvin Solomon and Steve Traugott}, booktitle = {Java Grande 2000, sponsored by ACM SIGPLAN}, month = {3-4 June}, url = {http://people.nas.nasa.gov/~globus/papers/JavaGrande2000/JavaGrandePaper.html}, year = {2000}, biburl = {http://www.bibsonomy.org/bibtex/27440f1370ae035866c8e827e05df7430/brazovayeye}, abstract = {A genetic algorithm code, JavaGenes, was written in Java and used to evolve pharmaceutical drug molecules and digital circuits. JavaGenes was run under the Condor cycle-scavenging batch system managing 100-170 desktop, desk-side, and rack-mounted SGI workstations. Genetic algorithms mimic biological evolution by evolving solutions to problems using crossover and mutation. While most genetic algorithms evolve strings or trees, JavaGenes evolves graphs representing (currently) molecules and circuits. Java was chosen as the implementation language because the genetic algorithm requires random splitting and recombining of graphs, a complex data structure manipulation with ample opportunities for memory leaks, loose pointers, out-of-bound indices, and other hard to find bugs. Java garbage-collection memory management, lack of pointer arithmetic, and array-bounds index checking reduces the frequency of these bugs, substantially reducing development time. While a run-time performance penalty must be paid, the only unacceptable performance we encountered was using standard Java serialization to checkpoint and restart the code. This was fixed by a two-day implementation of custom checkpointing. JavaGenes is minimally integrated with Condor; in other words, JavaGenes must do its own checkpointing and I/O redirection. A prototype Java-aware version of Condor was developed using standard Java serialization for checkpointing. For the prototype to be useful, standard Java serialization must be significantly optimized. JavaGenes is approximately 8700 lines of code and a few thousand JavaGenes jobs have been run. Most jobs ran for a few days. Results include proof that genetic algorithms can evolve directed and undirected graphs, development of a novel crossover operator for graphs, a paper in the journal Nanotechnology [Globus, et al. 1999], and another paper in preparation.}, keywords = {algorithms, genetic programming } } @inproceedings{conf/cluster/SonFL05, title = {A Generic Proxy Mechanism for Secure Middlebox Traversal.}, author = {Sechang Son and Matthew Farrellee and Miron Livny}, booktitle = {CLUSTER}, crossref = {conf/cluster/2005}, pages = {1-10}, publisher = {IEEE}, url = {http://dblp.uni-trier.de/db/conf/cluster/cluster2005.html#SonFL05}, year = {2005}, biburl = {http://www.bibsonomy.org/bibtex/2a0f8bb7808fffa6bcb70d7f670c5460e/dblp}, description = {dblp}, ee = {http://dx.doi.org/10.1109/CLUSTR.2005.347055}, date = {2008-05-28}, keywords = {dblp } } @inproceedings{conf/hpdc/SilbersteinGSL06, title = {Scheduling Mixed Workloads in Multi-grids: The Grid Execution Hierarchy.}, author = {Mark Silberstein and Dan Geiger and Assaf Schuster and Miron Livny}, booktitle = {HPDC}, crossref = {conf/hpdc/2006}, pages = {291-302}, publisher = {IEEE}, url = {http://dblp.uni-trier.de/db/conf/hpdc/hpdc2006.html#SilbersteinGSL06}, year = {2006}, biburl = {http://www.bibsonomy.org/bibtex/2490b836a7254de75804aa8d3816b6236/dblp}, description = {dblp}, ee = {http://doi.ieeecomputersociety.org/10.1109/HPDC.2006.1652160}, isbn = {1-4244-0307-3}, date = {2008-05-07}, keywords = {dblp } } @inproceedings{conf/hpdc/SilbersteinKSSL06, title = {Materializing Highly Available Grids.}, author = {Mark Silberstein and Gabriel Kliot and Artyom Sharov and Assaf Schuster and Miron Livny}, booktitle = {HPDC}, crossref = {conf/hpdc/2006}, pages = {321-323}, publisher = {IEEE}, url = {http://dblp.uni-trier.de/db/conf/hpdc/hpdc2006.html#SilbersteinKSSL06}, year = {2006}, biburl = {http://www.bibsonomy.org/bibtex/28571bcb8323285910a9df05579c61fc5/dblp}, description = {dblp}, ee = {http://doi.ieeecomputersociety.org/10.1109/HPDC.2006.1652166}, isbn = {1-4244-0307-3}, date = {2008-05-07}, keywords = {dblp } }