http://www.informatik.uni-trier.de/~ley/db/conf/hpdc/hpdc2007.html
hpdc 2007
http://doi.acm.org/10.1145/1272366.1272408	34	A Proxy-based Uncoordinated Checkpointing Scheme with Pessimistic Message Logging for Mobile Grid Systems	access bringing computing conference distributed efficient environments evaluate gifts grid gsem infrastructure international magi mobile model node pages paral park performance proceedings recovery references results scheme simulated simulation systems yeom
http://doi.acm.org/10.1145/1272366.1272402	28	Concepts and Components of Full-System Simulation of Distributed Memory Parallel Computers	alonso based been computer congestion control effects environment euro evaluated evaluation experimental experiments february full have ieee illustrate insee interconnection lecture magnusson miguel network notes platform proc references related ridruejo science simics simulation study system used volume work
http://doi.acm.org/10.1145/1272366.1272391	18	Using Content-Addressable Networks for Load Balancing in Desktop Grids	academic accountability addressable again albrecht allen analysis anderson applications approach architecture area awan balakrishnan balancing based bhatia bhattacharjee blocks building butt calder cheema chien chord christensen cluster cobb communications compup computational computer computing condor conference content convergence cycle cycles death department design designing desktop discovery distributed dwarkadas editors elbert enterprise entropia environments european experiment extended fang fast ferreira foster francis future global grama grid grids gupta handley heterogeneous high home hpdc hunter huth iamnitchi idle ieee implementation information international internet iptps jagannathan java jobs journal july june kaashoek karger karp keleher kluwer korpela lebofsky ledlie litzkow livny load location lookup machines management marsh maryland mastroianni matching midkiff model morris muhammad mutka nabrzyski network networks oppenheimer organizing overlay pages parallel patterson peer performance proceedings processing processor public publishers ratnasamy references report research resource resources retrieval runtime scalable scheduling schneidman schopf science scooped sekhri self seltzer semantic sept service services seti sharing shenker sigcomm simulation somani state stoica super sussman symposium system systems talia tang taxes technical techniques technology tradeoffs transactions trends turnaround umiacs university unstructured using vahdat version verta virtual volunteer wavegrid weglarz werthimer wide workshop workstations zappala zhao zhou
http://doi.acm.org/10.1145/1272366.1272370	2	Transparent Network Services via a Virtual Traffic Layer for Virtual Machines	abali able accomplish achieving adaptation additional address advantage agrawal allcock allowing allows also annual anonym anonymization anonymos appears appliance application applications approaches april architecture area august automatic backend badrinath bakre balakrishnan bandwidth bandwidthdelay barham based batch boneh border boykin bressoud build bustamante bypass calls capabilities capture case chandra chow clark codo computer computers computing conclusion conference configuration configured connections contained conveyed cooperative corporation datagram december defined degradations delay demand denali dependability design detection device differences dinda dingledine distance distributed does douglis dragovic driver dropp dynamic efficient efore enabling engineering enhancing environment environments establishing ethernet example examples executable extensible fast february figueiredo figure filter firewall first force fortes foster framework fraser free freeman from function functionality further future ganguly garfinkel generation goasguen goetz gribble grid griner grossman group guest gupta hand handle hansen harris have having help here high host hosting hosts however hpdc http huang huitema hutchins icdcs idses ieee illustrated implementation implementations implemetation improved including increasing indirect inference inferring infrastructure inside intel intended interactive intercept international internet interposition introspection intrusion ipdps isolation issue itself jacobson january janusvm jects jiang jspps july june just keahey kernel kind koblas kojo kozuch laboratory lakshman lange layer levasseur level libnet library life limpach link live livecd livny load long loss lowekamp machine machines made madhow mahy management manner many march mathewson mccane measurement memory migrating migration milojicic mitigate mixing mobile modification modify monitoring montenegro motivations nats nelson network networked networking networks neugebauer nieh note notion november nsdi october often onion opening oper operate operates operating optical optimizers optimizing organizing osdi osman overlay packet packets paindaveine panda paral parallel passive peertech performance periodic persistent pfaff pfldnet pittsburgh platform platforms praff pratt presented previous principles privacy proc process processing product products programming programs protocol protocols provides proxies proxying quality random range real reconfiguration references regardless related requires research reservations resource resume reuse rosenberg rosenblum router running ruth salz same sapuntzakis satyanarayanan scale scheduling scientific seattle second security selective self sends september server service services session share shared shaw shelby significant sigops similar simple simplified situations snoeren socks soda sosp sourceforge special specially specific state stoess strategies stun subhraveti submission such sundararaj supercomputing surveys suspend symposium syst system systems syverson targets task tech technical technique techniques technologies technology terra tesla that them there they this through time tool tools topology towards traces traffic transactions transfer translators transparent transport traversal trusted typically uhlig unix unmodified usenix user uses using utility very virtual virtualization vmware vnet vortex vsched waldsburger warfield weinberger wheeler which while whitaker wide winpcap winter with without work working workshop workspaces workstations wormholing zangrilli zhang zhou
http://doi.acm.org/10.1145/1272366.1272369	1	A Fast Topology Inference -- A building block for network-aware parallel processing	acknowledgments advances algorithms anonymous application applications architecture architectures area assistance aumage balanced based beisel berman bhoedjang black breitbart bstavros burger byers caida castro characteristics cluster clustered clusters coates collective committee communication communications comput computational computer computers computing conference cottrell crovella discovery distrib distributed donnelly donnet duffield ecially edge effective efficient eling enabled enabling environment erations erschatz ethernet european eval forecasting foster fournet fourth friedman from future gabriel gadhiok garofalakis generation grid gross group hallaron harfoush hayes heterogeneous hierarchy high hofman horowitz hpdc http hughes iccs icnp identification ieee imamura implementation induced inference information interface international internet jones journal karonis keller kielmann king koide large library likelihood logical london loss lowekamp machine madi magpie martin maximum measured measurement measurements meeting mercier merging message metacomputing metric monitoring mpich multicast multicasting netinventory netw network networks nowak ologies ology page pages paral parallel part passing perform performance plaat portability ppopp practice press presti principles proceedings processing programming promote protocols rabbat raoult rastogi recent references resch resource reviewers scale science service seventh shao shepherd sigcomm sigmetrics sigplan silb skitter society spring springer stampi supercomputing swany symposium syst system systems takemiya techniques technologies thank their theory thilo through throughput tierney tool tools toonen topomon towsley trans transactions tsang tsujita unicast users using verlag views virtual washington weather wide without wolski workshop york
http://doi.acm.org/10.1145/1272366.1272403	29	LIVE: A Light-weight Data Workspace for Computational Science	bustamante cdrom ciety computer computing conference efficient eisenhauer erformance formats high ieee page proceedings references schwan supercomputing widener wire
http://doi.acm.org/10.1145/1272366.1272392	19	Direct-pNFS: Scalable, transparent, and versatile access to parallel file systems	abstract access acknowledgements activescale advanced adya allcock analysis anastasiadis andrews annual ansi appliance applications architecture arrays asci association asynchronous atlas atlasinfo australia available award aydt baker barcelona baru based batsakis beach benchmark benchmarks berlin best bester bigfoot bitmover black block bolosky bolton boston brandt bresnahan bring broker burns cairns calderon callaghan canada carballeira cardiff carretero case castro centre cermak cern chadalapaka chaiken characteristics chervenak chicago chien cifs client cluster clusterfile clusters collaborations collaborative college commands common computational computer computing concluding conf configurations contract crandall critical data datafarm delegation demonstrate denneulin department design device diego different direct directpnfs disk disks distributed diverse douceur down draft eisler ellis enables enabling energy enhancing environment environments exedra existing expand experiences experiments exporting exports extended fail farsite fault feature federated fernandez file files flexible fort foster francisco fridella from furthermore fusion ganger garcia germany ghemawat gibson glasgow global gobioff goddard google gpfs grants grid gridftp grove halevy hand hartman haskin helps high highperformance hildebrand hiperio honeyman hong howell ibrix ieee implementation incits incompletely industry inexpensive input intensive interface internet intl isaila iscsi jordan jose journaling katcher katz keefe kesselman kotz kupfer labs landing large lauderdale layout lederer leung library life limited linux llnl lombard long lorch lustre management manner marching mass matches material matrix matsuoka mckusick mclarty mcvoy measurements meder media meta meth microsoft miller minnich minor monterey moore morita msdn multimedia nasa national nefedova network networking newport nfsp nfsv nieuwejaar nirvana noveck numbers object openssh operating operations other ousterhout outperform output pacific panasas parallel park patterson pawlowski perez performance petascale pfeiffer physical pnfs polyserve portability postmark principles proc processing production protection protocol purakayastha purple pvfs quesnal raid rajasekar redhat redundant reed references reliable remarks remote report requirements research resource ruwart sandia sapuntzakis satisfies satisfy satran scalability scalable scale scales scaling schlatter schmuck scientific scsi sdsc sekiguchi seltzer server sevcik shared sharing shepler shirriff sigmod small smith soda soft software soltis soules spain specialized specification spie staubach stein stock storage strauss striping studies stumm such supercomputing support supported symp system systems tatebe technical technologies thank that theimer these this three throughput tichy titanic tolerant toronto towards trans transfer transparency transparent trusted tuecke under universal updates upon usenix version versus very virtual volume wang ward wattenhofer weber welch widely with work workload workloads workshop workstations writes zeidner zelenka
http://doi.acm.org/10.1145/1272366.1272375	6	Cooperative Secondary Authorization Recycling	access administration analysis application approach approximate armor arrowhead authorization authorizations available barham bauer bell beznosov borders bresnahan brewer brighton burrows caching california castro chapter chase chubby collaborative college common commun communications communities comput computer computing concepts conference conjecture consistent containment control controlw corbaservices costa coupled cpol crampton crispy crowcroft czajkowski dartmouth decentralized decision demichiel design deswarte diego distributed druschel enterprise entrust evaluation extensible fault feasibility february flooding foster foundations gadde garriss gawor getaccess getting gilbert grid guide hall healing heidelberg high hpdc ieee ifip implementation information integrated international internet introduction invited isoc javabeans johnson june kalbarczyk karjoth keromytis kesselman krishnan lake language lapadula large leung locasto location lock london loosely lost lyer lynch management manager march markup massive mathematical mazzuca meder microsystems middleware mitre model models ndss netegrity network news nicomette node november nspw oakland oasis object october operating oregon page pages paradigms partition pastry pearlman peer performance platforms point policies policy portland prakash prentice press principles privacy proceedings proving rabinovich recycling references reiter report river road robust routing rowstron sacmat saddle saml scalability scalable scale scheme schemes science seattle secondary securant secure security self september server service services seventh sidiroglou siebenlist sigact sigcomm siteminder society software sosp specification spring springer squid standard stowe survey symposium system systems tahoe talk taste technical technologies tivoli tolerance tolerant toronto towards transactions tuecke unified upper using verlag version vigilante vogels wang washington welch with workshop worms wrong xacml yalcinalp york zhang zhao zhou
http://doi.acm.org/10.1145/1272366.1272374	5	RIDGE: Combining Reliability and Performance in Open Grid Platforms	anderson april automatic availability baik based bavier blast boinc bowman brevik ccgrid choi chun cluster cobb communications computing culler design desktop environment experiment fault fifth grid home http hwang ieee implementation international karlin korpela lebofsky machine mechanism methods muir ncbi network networked nsdi nurmi operating peer peterson planetary predicting proceedings public references resource roscoe scale scheduling services seti spalink storage support symposium system systems tolerant volunteer wawrzoniak werthimer wolski workshop
http://doi.acm.org/10.1145/1272366.1272405	31	Security and Dynamics in Customer Controlled Virtual Workspace Organisation	about above accepted access accounting added additional against application applications assertions authentication authorisation authorization authz authzframe authzticket available based bologna case cern chain collaborative complex component computing configured contained contains content context data decision delegation demchenko described developer distributed docs document domain dynamic edms environment evaluation existing extended extending features first framework frameworks functionality generated generic gjaf glite globus gommans granted grid group guide handling home html http https identify ieee important include index information initial international italy java june laat least management module necessary networks obligations online oriented orlando other override paper permit point policies policy positive presented preserve projects provide provides provisioning references request requested requesting research resource result saml science security service session sessions should slow special such supported symposium systems technologies that ticket toolkit triagepdp trusted trustedcomputinggroup usercontrolled using validity verified virtual vwss when will with without workshop workspace workspaces xacml
http://doi.acm.org/10.1145/1272366.1272401	27	IDEA: An Infrastructure for Detection-based Adaptive Consistency Control in Replicated Services	adaptive based beijing china consistency control cost data detection distributed efficient environment feng framework grid hpdc icebe idea ieee inconsistency infrastructure internet jiang july lincoln nebraska park proc references replicated report research scale service services sharing system technical triangle university
http://doi.acm.org/10.1145/1272366.1272390	17	High Performance and Scalable I/O Virtualization via Self-Virtualized Devices	abali access accessible annual applications architecture arsenic based basu beyond buch bypass cameracast card case cercs channel chien cluster clusters communication computers computing concurrent conference connection constrained core deegan development devices diagnosing direct distributed dynamic efficient eicken engine environment ethernet eurosys evaluating execution experience facilitating fast flexible fraser fujimoto ganev georgia gigabit gorda hand handoff high himanshu hpca huang ieee illinois impact infocom intel interface international ivan jimi jose karsten kong krintz kuznetsov lauria level linux machine machines mcauley media menon messages messaging micro mmcn monitors multi multimedia multiprocessor myrinet network networking neugebauer offload olsson ottawa overheads packet pakin panda parallel performance pratt proc process processing processor processors programmable real references regnier remote report research rixner rosu salim scalable scheduling schwan self sensors servers showcase sigcomm soft softnet sosp streams supercomputing supporting symposium systems tech technical technologies technology through time towards transactions uhlig usenix user video virtual virtualization virtualized vogels vtdc warfield west widener willmann window with wolski workshop workshops workstations xenidis xeon youb youseff
http://doi.acm.org/10.1145/1272366.1272383	12	Data Driven Workflow Planning in Cluster Management Systems	across adya ahmad algorithms allocation applications arpaci askalon atlas automating availability available aware based batch benchmarking bent biomedical blast blythe bright ccgrid centric chervenak chimera cidr citizen class clusters communication communities comparison comput computation computer computers computing condor conference considered constructing control costs data database deelman derivation design desktop dewitt digital distributed driven dusseau dynamic efficient environment european execution experiment explicit fahringer fair farsite federated file first foster framework franklin frequently gamma giggle graph graphs grid griddb grids griphyn high hpdc html http hwang icdcs ieee improving incompletely informatics instruction interprocessor ioannidis journal june knowl korth kosar kwok large least livny location lohman lopez lrfu machine maier making management manual mapping meet midwest model nbirn ncbi network nieto nsdi onto oper overlay pages parallel peer pegasus performance physics pipeline placement policies precedence priorities proceedings processing prodan project quarfoth query querying ranganathan recently record references reliable replica replication representing research romosan rotem santisteban scalable scheduling scientific sdss seattle services share sharing shoshani siam sigmod sigops sloan spectrum springer ssdbm storage stork strategies subsumes survey symposium syst system systems task tasks thain that through times trans trusted usatlas used user virtual vldb vockler washington when wieczorek wilde wisc with workflow workflows workloads wright zhao
http://doi.acm.org/10.1145/1272366.1272404	30	A Computational Infrastructure for Grid-based Asynchronous Parallel Applications	carriero characterizing communications computing context coordination decentralized desktop dissemination empirical enabling environments evaluating flexible gelernter grid grids guarantees ieee information infrastructure internet ipdps issue june kondo linda parashar proceedings queries references rutgers scalable schmidt special study systems thesis university with
http://doi.acm.org/10.1145/1272366.1272410	36	Measurement of a Large-scale Overlay for Multimedia Streaming	active advances again below collective commercial compare degree described discovery dynamics each first follows gupta impacts information insight into iptv large liang links list lists live mapping mathur measured measurement media nahrstedt nature network networks node nodes obtain operation over overlays partner partners peer peers pick polytechnic pplive probability randomly recent references report root ross scale second select simultaneously small snapshot streaming strogatz study studying svcs system technical that their then third uiuc unconditional verify video watts whether workshop world wshop zhang
http://doi.acm.org/10.1145/1272366.1272398	24	Towards Adaptive, Scalable, and Reliable Resource Provisioning for WSRF-compliant Applications	according achieved alliance also anatomy apache architecture assuming available becomes bottleneck client clusters committees computer data dean deployment design direct distributed dsls dynagrid dynamic effectively enabling environment estimated evaluation execute execution experiment experimental failure figure foster framework gawor ghemawat globus grid gridmr hand handsubmitted highly hosting http illustrates implementation infrastructure input integration invocation ject kesselman large lecture loss mapreduce minute most nick notes nput number nutch oasis ogsa only open operating organizations oriented original osdi pages papers physiology practically presents probability proceedings processing proxy publications recovery references research resource resources result scalable science seconds server service servicedoor serviceresource services settings several shows simple simplified since single software survival symposium systems table takes that throughput time toolkit tuecke version virtual whole with without wsrf
http://doi.acm.org/10.1145/1272366.1272400	26	PeerStripe: A P2P-Based Large-File Storage for Desktop Grids	applications arrays butt caching case cation computing disks distributed druschel enhancement ensive erasure ersistent fast file gibson grid ifip inexp ject johnson journal katz kosha large leware management maymounkov midd network online past pastry patterson peer plank proc raid redundant references routing rowstron scalable scale sigmod sosp storage system systems technical tutorial university usenix utility york zheng
http://doi.acm.org/10.1145/1272366.1272394	20	Environmentally Responsible Middleware: An Altruistic Behavior Model for Distributed Middleware Components	access aguilera approach availability brand chen communications computation computer computers computing concurrency coordinator detectors egee electric enabling experience failure fault frey gray grid grids high http ieee implementing industrial klous lerner livny machine open opensciencegrid personal physicist practice quality references resources schneider science service services siewiorek software state surveys systems thain tolerant toueg transactions transparent tutorial user using what with wrong
http://doi.acm.org/10.1145/1272366.1272397	23	Evaluating the Impacts of Network Information Models on Applications and Network Service Providers	achieve achieved application april attributed august average bernstein casanova chien communication communications comparable compares computational computer conndom conninter content distribution domain efficient enables enough february find grids high information interdomain journal kangasharju lambda latency mahajan measured measuring metrics modeling models network networking networks none november object open optical other outperform preliminary proceedings rate realistic references regions replicaiton reported request requests results roberts rocketfuel ross routing saturation sharma sigcomm significantly sprint strategies synthesis system table that their these this throughput topodom topointer topologies topology using utilization were wetherall which with
http://doi.acm.org/10.1145/1272366.1272409	35	Fault-tolerant Scheduling for Differentiated Classes of Tasks with Low Replication Cost in Computational Grids	about always applications backup benkner blueprint boundary brandic brasileiro cases cirne classes cnds completion computational computing conference cost critical deterministic differentiated done edition engelbrech exist fault faults figure first foster four future gonzalez grid grids have higher hpdc http infrastructure international interval kaufmann kesselman later lemma medeiros morgan only other overloadable possible proceedings processor publishers qinzheng references replication report same sauve schedules scheduling schmidt science september support surveys tasks technical tham than there they time tolerant veeravalli what with workflow workshop zheng
http://doi.acm.org/10.1145/1272366.1272378	8	A Statistical Approach to Risk Mitigation in Computational Markets	abramson adam addressing agent alex algorithm allen allo american amin analysis anderson andrade anticipating applications architecture archive artif arxiv asset association bandhakavi barham based basic batch behavior benjamin blueprint brent brevik bryan buonadonna buyya cadzow calvet capacity cation cator cavallo chaki chanskij chner chun ciety civil clearwater clusters combinatorial commerce comp computation computational computer computing conference confidence construction controlling corn culler cumulative david dawant dead delay deployed desouza dimension discussion disruptive distributed distribution distributions dman dragovic druzzaman ducing eastern economic economics economies economy efficient ekel electromyographic electronic ellert elprin empirical enabling engineering engineers ercomputer eren erformance erman erola ertelli etition exchange exchanges eychik faucets feldman feller first fisher forecasts formulations foundation fractal fraser function grid gridis guide hahn hand handbook hansen harris hassan heavy high hogg home hpdc http hudson huji hurst icaps icpp ieee incentive index information innovative intel international internet intervals into intro introduction inverse invnorm ipdps issue iterative jacklam jair jeffrey jobs john journal juda july june justification kale kephart kilroy kleban konsantinov konya kumar labs lahaie lecture limited limits line live loizos long lubin machines mackie mandelbrot march market markets mason mathematical mechanism meeker metho michael micro middleware models multifractal national networking neugebauer nick nielsen nisan nordugrid normal notes nurmi odeb online operating options osepayshvili ould ounds page pages papers paral parallel parkes peer performance peterson petunin philip plank potnuru ppopp practices practitioners pratt predicting prediction price principles probability proc proceedings processing programming queuing range reeves references regev rescaled reservations reservoirs resource resources returns reward risk rosco ruggiero ruin rule saada sand sandholm sandia scheduled scheduling science scientific sebastien shared shiavi shneidman sigecom sigma signal simple smirnova society software sons souteastcon spawn special springer statistical statistics storage stornetta strategic strategies sultan swing symposium systems tailed technical technologies technology telling term theory topics trading truth unimo university using vahdat venugopal verlag view virtualization volume vorob vyso waldspurger warfield washington wellman wiley wilkes williams williamsburg wolski workload workloads workshop xiao yale york zhang
http://doi.acm.org/10.1145/1272366.1272387	15	MOB: Zero-configuration High-throughput Multicasting for Grid Applications	achieving active adaptation adaptive advanced agridm algorithms allocation analysis anchorage annual antibes application applications approach april architectures area asci august available aware bakker balanced bandwidth baraniuk barbara barcelona based bates beaumont berkeley berlin bhoedjang biased bindal bittorrent bittorrentecon bloomingdale bolton bresnahan broadcast build burger canada cancun capacity castro chan characteristics cluster clustered cohen collective commo communication communications competing computation computational computer computing concurrency conf conference connectivity construction content control cooperative cottrel cottrell data delphoi denver design devera devik discipline dispersion distributed distribution dity dovrolis druschel economics ectral efficient emulation environment environments estimation evaluation experience experiences exploiting fast february file flexible forum foster france future ganguly garbacki germany geusebro global gorlatch grid gropp gross guide hemminger heterogeneous hierarchy high hofman horus hpdc http hughes hypersp ibis icdcs ieee image imagery implementation improving incentives infocom international internet iosup ipdps iptps iwqos izmailov jacobs java joint jolla jones journal juan july june kaempfer karonis karrer kermarrec kielmann koelma lake langendoen lartc lelism leware line linux lisb locality lowekamp lusk luxik maassen magpie manual march marchal measure measurement media medval mexico midd middleware miller monterey montreal multicast multicasting multimedia multiple myrinet nahrstedt nandi navratil neighbor netem network networks nieuwpoort november october operating operation operations optimal optimize optimized osed overlay packet pages paral parallel passive pathchirp paths peer performance pins plaat platforms plaza portugal pouwelse ppopp practice predicting press principles problems proceedings processing programming prop providence quality queuing ramanathan rate recommendation references reidi reinders reliable remos replication resource review ribeiro robert robustness routing rowstron santa seattle seinstra selection september service services sessions settings sigmetrics sigplan singh sips smeulders snoek social societies solving sosp spaa spain splitstream steen steenkiste streaming supercomputer supercomputing supinski suwala swany symposium system systems techniques throughput tierney traffic tree trees tribler unicast user userg utilization verstoep video volume wangand what wide with wolski workshop worring wrzesinska yang zhang
http://doi.acm.org/10.1145/1272366.1272406	32	Generating Grid Resource Requirement Specifications	application applications approach approximate best better casanova ccgrid chicago chien cluster computer computing consider constraint data decrease department description distributed doubling each efficient first formulation foster from globus grid grids high hpdc huang hypothesize ieee increased infrastructure international ipdps journal kesselman knee language livny logarithm management matchmaking metacomputing model modeled need noticed only pair parallel parallelism performance planar plot proceedings processing quality raman references regularity report resource scheduling science selection shapes similar simplify size slight solomon solve suggesting supercomputer symposium technical that thereby throughput thus toolkit tractability university using value values versus very virtual when where
http://doi.acm.org/10.1145/1272366.1272380	9	Feedback-Directed Thread Scheduling with Memory Considerations	able access actual administration affinity after algorithms also although analysis applications approach architectures assigning automatically based binary cabaleiro cache cacheminer carter cheap chip chips codes coherent completely computation computations computer conference cores corresp data demonstrates determine development different directed disk distance distrib distributed dongarra dynamic ecially effective ehavior eickemeyer either eliminates ensive erations erform eriments etween execute execution exploit false feedback first four framework functions good graph guide have heras hierarchical hierarchy hsieh identify ieee improves incorp instrumentation international into involved irregular ispan journal joyner kalla level library linux locality maximize mckee mechanism memory method microarchitecture misses model modeling moore multi multiprocessors nature networks node numb onding online optimal optimized oral orating original overhead page paral parallel particular partition partitioning patterns pichel pingali power present press proceedings processor processors program programming programs real reduce reduces references remote report represented research resource restructuring rivera runtime schedule science scientific second shall shan shared sharing shown significantly singh sinharoy song sorting step structure supercomputing symposium syst system systems technical technique techpubs temp tendler that thread threads time tool tracing trans using well which with york zhang
http://doi.acm.org/10.1145/1272366.1272381	10	Precise and Realistic Utility Functions for User-Centric Performance Analysis of Schedulers	abdel according accuracy accurate actual aggregate ahuva aima alem alex allan allocation alvin amin analysis analyzing applications approach april archive artificial arxiv auyoung available backfilling bailey balancing based batch benchmarks berkeley blue bounds brent brevik bryan buonadonna california center centric chaki chapin characterization chase chun cirne cliffs cluster code compares comparing completely computational computers computing conditions conference contracts convergence coplot culler cynthia daniel datastar david delay dialogue diego diehr distributed dmitry does dror dynamics each earheart easy economy embedded engineering englewood environments estimates estimation evaluation except explore extra february feitelson figure file fine flurries format frachtenberg france from functions greater greece grid grit hall hardy have heavy help high hogg html http huberman huji hussein hypothesis ieee impact improvement inaccuracy inaccurate increased inherently input instability intelligence international interview irwin island james janet jeffrey jennifer jersey john jolla jones journal june keleher kenneth kephart labs larry laura length leutenegger license load logs management marked market means method metric microeconomic mirage models modern mystery nancy networked norvig november nurmi october original parallel paris parkes parkson patton performance personal peter pfeiffer philip plank positive positively pothen practice predictability predicting prentice proc proceedings processing provided python queueing raveh readme references report requested resource reward rhodes rich risk role rudolph runtime runtimes russell scheduler schedulers scheduling schwartzman schwiegelshohn schwiegelsohn scott sdsc sensornet sensors series service sevcik shared shneidman simulation smith snavely snoeren software solving space spacesharing spawn specific standard standards steve stoica stornetta strategies stuart studies supercomputer supercomputers symbiotic symposium system systems talby task technical terms testbeds than theory thesis this those todd toward trace trans transactions travis tsafrir tycoon typical under university used user userprovided userscheduler using utility utilization vahdat version versus wahab waldspurger walfredo warren wayne weinberg when wiener wilkes wilkins wished with wolski wong workload workloads workoads workshop would yael zotkin
http://doi.acm.org/10.1145/1272366.1272372	3	Failure-Aware Checkpointing in Fine-Grained Cycle Sharing Systems 	aguilera algorithms appear approach assessment availability bagchi balancing based basney behavior berkeley brevik built buyya byzantine cachin calculus camargo cerqueira checkpoint checkpointing cluster coded codes combinational complexity computation compute computers computing concurrency condor creating cycle data dedicated desktop dinda diskless dispersal distributed dover efficient efficiently eigenmann elwasif empirical engine environments erasure evaluation experience experimental extraterrestrial failures faster fault fine forecasting future generation gentzsh grain grained grid gridsim halaron harvesting hayes hollingsworth home host hpclab hpdc http icpp ieee impact implications information intelligence international internet ishare janakiraman journal kangaroo large latency leware linear ling livny load management managing metacomputing midd minimizing modeling models movement murshed network networks nurmi open optimal optimization overhead page pages papadimitriou paral peer performance placement plank policing power practice prediction proc processing publications puening purdue rabin ratio references report repositories resilience resource resources sahoo scale scheduler scheduling scheme search security service seti setiathome sharing simulation sivasubramaniam spring squillante stealing steiglitz storage storages strategies studies support symposium system systems tannenbaum technical tessaro thain their time tolerance tolerant toolkit towards trans turnaround university using vaidya variational wave weather wolski workshop workstation workstations zhang zhou
http://doi.acm.org/10.1145/1272366.1272368	0	SmartSockets: Solving the Connectivity Problems in Grid Computing	accepted across addison address agapi agrawal alliance allo annual applications approach april architectural architecture area arrg asia assessment aumage based behavior biggadike boykin burger california caromel cation characterization cluster cohen communication computational computing conference configuration configuring conjunction connections connectivity costanzo datagram decemb delb denis deploying design devices dinda directions distributed drost egevang ehind eigenmann elements enabling erger eriences establishing etween executing experimental expgrid fdna felderman ferullo figueiredo firewalls ford fortes framework france francis freed future gamma ganguly ganis gigabit going gossiping grid grids guha hain hawaii helm high hofman honolulu hosted hosts hpdc http huitema identifier ieee implications infiniband infinibandta infrastructure integrated international internet internets internetworking ipdps java jiang johnson jones july june karrenb kegel kielmann koblas kuris kuthan large leach lear leech leyton livny maassen machine machines mahy mealling measurement methods micro middleb molitor monitor monterey moskowitz multicasting myrinet namespace natblaster nats netfilter network networks nieuwp nutss object obsoleted ogston oprescu organizing oriented over overlay pages paral parallel paris patterns peer performance perrig platform play plug press private proactive problems proc proceedings processing programming programs proto publication rayhan reading real recovering references rekhter requirements research reusable rosenb running salz scale science second security seitz seizovic self sharing sigcomm simple socks software solution srisuresh stun sugerman sundararaj symmetry symposium system systems takeda technical technology testbeds through throughput tools towards trade traditional translator translators traversal tsugawa unique universal universally upnp usenix user uuid venkitachalam version versto vine violin virtual virtualizing vlissides vmware weinb wesley wide wilson with workshop workstation workstations world york zero
http://doi.acm.org/10.1145/1272366.1272396	22	CCALoop: Scalable Design of a Distributed Component Framework	access actual also amount application avail better ccalo changes choose compliant component components corba data describes disseminate dynamic every executing execution figure focus follow four framework frameworks gets important interfere involved jority kind main manage means more necessary obtain ones onsibilities other overhead paradigm performance performs purpose references relatively resp several small some staging static store style tasks that they this types usually which with work
http://doi.acm.org/10.1145/1272366.1272385	13	Partial Content Distribution on High Performance Networks	achieve adding address advances after akamai albrecht algorithm algorithmic allcock allocation alone already among anderson another appendix application applications approach april areas array attained available avoid avoidable balakrishnan bandwidth bester bits bittornado bittorrent block blocks bresnahan buffer buffering buffers build bulk bullet byers cache cachelogic call capacity ccgrid chain chervenak chien chiu chord chunk chunks client cluster code codes coding cohen collects combinations combine combines combining common communication comp comparable comparison computational computer computing concatenation conference consider constraint constraints content continues control corp create cross current data decentralized decode design desire desired desires digital discrimination discussed disparate dissemination distribution ditional does done dougherty download downloading downloads dramatically druschel dummynet each ears easy edges edia edmonds eeds eers efficiency eing elled encoding endencies endency endp ensive entails environments equipment erasure erformance etween evaluation example excess exist extra fairness falls february fifth figure file flexibility flexible flow flows floyd ford foster fountain framework framing freiling from fulkerson functions gains gbps generality ghemawat given global globally gobioff google grid guarantee have hawe headers high highlighted highly hips hoffman however hpgc http ieee immutable implementation improve improvements inappropriate incentives information international internet interpreted into ipdps isdal issues iterative iteratively itself jacobson jain ject join joined joins joint june just kaashoek karger karp kesselman known kostic krishnamurthy language large lecture leung level light linear littleton location locations logic lookup luby lustre main management maximal mbps mccanne measure meder mesh minimal minimum mitzenmacher models morris multicast multiple must native necessary needs nefedova neither network networked networking networks nlog node nodes notes novemb nsdi nsnam numb octob ofbittorrent oint oints older only operating opular oration osite ossible otentially other ottleneck outside over overlay overwhelms packets pages panacea paral parallel parker part partial partially pastry performance piatek press primary princeton principles probably problem problems proceedings processing programming programs protocol protocols provide provided python quantitative quesnel ranges rate reassembling redhat reducing redundant refer references rege reliable removes removing represents research resource results reveals review right rizzo robust robustness rodriguez routing rowstron scalable scale scheme science second section secure seem service sessions shared sharing shot shown shows sigcomm significant similar simple simply simulator society software solve solved solving sosp split step stoica string strings structure structures such sussman switching symb symbol symposium system systems tasks technical technologies terabit termination text that their then theoretical theory there these theshad they third this those time total transactions transfer transfers transmissions tuecke unacceptable unachievability unique university unsurprisingly until usenix using vahdat various venkataramani version versions volume wants weight weigle where which whole wholefile wiki wikip will with work works workshop yeun zeger zhang
http://doi.acm.org/10.1145/1272366.1272382	11	A Provisioning Model and its Comparison with Best-Effort for Performance-Cost Optimization in Grids	adaptive advance agreementbased algorithms amsterdam analysis anatomy application applications applying architecture askalon assessment astronomical atmospheric backfilling barcelona based batch best bounds brevik broker building buyya capacity catlett ccgrid characterization clement cluster coallocation commit community comparison complex complexity computation computer computing concept concurrency condor conference consortium core cyberinfrastructure cybershake czajkowski dagman data deelman defined delay discovery discussion distrib distributed droegemeier editors education effort elastic enabling enhancement environment environments escience evaluation evolutionary example execution exper experience extensible facility fahringer feitelson fifth first fleming florida fonseca forecasting formulation foster four framework france from future generalization generation genetic gravitational grid grids gridsim griphyn haji hariri hayes henderson heterogeneous high hpdc http huji hunter hydrology icpp idle ieee image implications increase information integrated interactive international intl iosup ipps jackson john journal jsspp katz kesselman labs large lead level ligo linked litzkow livny load logs management managing mandal mapping maui merged mesoscale meta metacomputing meteorology methods middleware model modeling modelling mosaics multi multiobjective murshed mutka mutli negotiation network nurmi objective oceanography onto open opensciencegrid optimization optimized organizations papers parallel pegasus performance performancecost performanceeffective phase philosophy planning policies portable pract practice predictability predicting prediction proc proceedings processing prodan production programming protocol provenance provisioning quality queue queueing real references reinefeld report research reservation reservations resource resources revised roblitz rsvp sabin sadayappan sahasrabudhe saintmalo sakellariou scalable scale scheduler schedulers scheduling schintke science scientific scientists seattle second service shared sharing siddiqui sigmod simulation singh site snap snell softw sons space spain spdp spring springer strategies study supercomputing supports symposium syst system systems tampa task taylor technical teragrid terascale that three time toolkit topcuouglu traces tracking trans tuecke under used user using utilization utopia verlag villazon virtual wait wave weather weil wendler wieczorek wiley wisc with wolski workflow workflows workload workloads workshop workshops workstations zhang zhao zhou
http://doi.acm.org/10.1145/1272366.1272388	16	An Efficient MPI Allgather for Grids 	adaptive advances algorithms allocation annual application applications architectures area australia automatic aware bcast beaumont benson berlin bhoedjang boudet broadcast bruck building caglar cancun carnegie casanova chan chikayama clustered clusters collective colorado combinatorial communication communications comparison computation computational computer computing conference culler discovery distributed efficient eicken eleventh enseifner eration erations estefanel euro europ exploiting fara fast foster foundations fourth geijn generation gorlatch greece grid grids gropp group gupta heidelb heterogeneous heterogenous heuristic hierarchy high hofman hollermann home homogeneous http huang identifying ieee ijfcs information interface international ipdps island issues journal june karonis karp kielmann kipnis kwon languages lecture lgather links lncs logical logp lowekamp machine magpie mateescu measurement meeting melb mellon message method mexico model modeling mounie mpich multip multiple network networks notes novemb ologies optimization optimize oriented ortmessage ourne over page pages paral parallel parameters park passing patterson performance petersburg plaat platforms ppopp practial practice principles problems proceedings proceeginds processing processors programming realistic recent references rhodes routines russia sahay saito santos scale schauser scheduling science septemb seventh sigplan simultaneous spanning spring springer subramonian supercomputing supinski supp swany switched symposium systems taura thakur that thesis towards transactions trees tuning university unix upfal users using vadhiyar verstoep vertanen virtual volume weathersby wide with wolski workshop workshops yuan
http://doi.acm.org/10.1145/1272366.1272407	33	Scalable, Fault-tolerant Management in a Service Oriented Architecture	about achieved adapter adding additional adopted after aggregation agreement align also analysis application applications appropriately architecture arora barcelona based between bootstrap building capabilities capability case challenges channabasavaiah check chep chun cirstoiu clade cohen communication community complementary components compute computing conceptual conference configuration configuring contrast correspond created culler davin davis define delivery design devices distributed driven durable dutch dynamic edward empirical enabling environments every exchange existing experience expose extensions facilitates facility fault feasible features fedor figure finally forecasting framework frameworks framwork france gadgil ganglia glavez global grid grids health high holley however hpdc http huang ieee ifip implementation including increases independent indiana information infrastructure interface international java jola journal june kreger lack large layer legrand lifecycle makes manage manageable management manager managing march massie messages messaging metrics middleware migrating model monalisa monitoring naradabrokering needs network networks newman number only oriented osgi pallickara parallel paris peer percentage performance pierce primary proposed protocol provide provided provides ptliupages publications publish purpose reduces references related report required resource resources runtime scalable scheduling schoffstall secure security service services shows simple snmp soap some spain spawned specification specifications standards state subscribe such suite support system systems technical technology that there this time tolerant tools topeer transport tuggle units usenix using variety voicu weather which whose with wolski work wrap wrapped write wsdm wsrf
http://doi.acm.org/10.1145/1272366.1272373	4	Using Queue Structures to Improve Job Reliability	alamos analysis applications area assessing august automatic availability available backup barbara barrett barroso based boston brevik brussels buffer calculating california ccgrid center characteristics cheap checkp clearwater cluster clusters computation computer computers computerscience computing conclusions conference coscheduling daly data dependable derived design desktop disk distributed does drive dumps easy easyfit edition eling engineering enterprise environments erating erational ercomputer ercomputers ercomputing erformance estimating euro failure failures fast fastest fault feitelson file framework gibson gottumukkala grid grosh heath heights high hill hours html http ieee impact implementation implications improving initiated international interscience interval introduction investigating ipdps iyer jects jiang jobs john journal jpdc jsspp kalbarczyk kalyanakrishnam kleban kochmar lanl large latency leangsuksun lecture lightweight lisbon lublin lumsdaine machine maintainability making management martin mathwave mcgraw mean methods model modeling models mttf murray murthy nassar national network networked networks nguyen noble notes nurmi oint ointing oldfield online operating optimizes opulation oratory ortfolio osdi overhead overlay package paral parallel pastiche performance petrini pinheiro pittsburgh portugal predicting press primer probability proceedings processing processors products quantifying ratio rausand real recovery reddy reese references reliability reliable resource restart review rigid risk running ryan sahay sahoo sankaran santa scale scaling scheduling scheme schroeder science scott second september series sigmetrics sivasubramaniam society software sommerfield springer squillante squyres srds statistical statistics stone storage strategy study symposium system systems tech technologies terascale that theory this thousands tokyo tolerance trans trends ucsb university usenix using vaidya validation vizinok volatile washington weibul what wide wiley windows with wolski workload workshop workstation world yland york zhang
http://doi.acm.org/10.1145/1272366.1272377	7	Charisma: Orchestrating Migratable Parallel Objects	active adaptive algorithms allocation analysis ananth anshul applications architecture architectures arrays attila australia balancing baltimore barker based benefits benjamin biomolecular case chandy chao chaudhary checkp chee chemistry chrisochoides city coast communication comp compilers comptational comput computation computational computer computing conf conference culler cummings dagum darden data dataflow derek design desouza distrib distributed driven dynamic dynamics eager ecifically edward efficiency efficient eicken engineering enmp ercomputers erformance europe evaluation ewald february fine flow fortran forum foster framework gaudiot gengbin george glenn gold goldstein grained grama gupta gursoy handbook hawaii heterogeneous hicss high highly huang hybrid iccs ieee indiana industry initio integrated interface international introduction irregular james january jayant jean jections jiang john journal june kale karypis koelb kumar lafayette language languages large laxmikant lazowska leonardo level liang libraries limited ling load london loveman march mark martyna measurement mechanism melb memory menon mesh message messages method migrating migration model modular modularity molecular multiphase multiprocessor multiprogrammed naik namd nikos novemb ointing ourne pages paral parallel parallelization parle particle passing pedersen performance phillips plane practice press principles proc proceedings process processes processing processor processors programming publishing ramesh ramkumar redwood references reuse sameer sanjeev scalable scaling schauser schreib science sciences scientific septemb setia shared sharing sigmetrics sigplan simulation society springer squillante standard steele study sums supercomputing symposium syst system systems terascale thousands thread tuckerman vadali verlag vipin volume wave west with workshop york zahorjan zheng zosel
http://doi.acm.org/10.1145/1272366.1272395	21	Peer-to-Peer Checkpointing Arrangement for Mobile Grid Computing Systems	akogrimo allocation april based basu business ccgridw checkpointing cluster collaborative computing conference consortium coordinated dependable distributed framework game ghosh grid grids huang ieee intl ipdps july large middleware mobile modeling networks november operating overview palm paper parallel pricing proceedings processing project references scale secure services short strategy supercomputers symposium system systems theory tool wang wesner white wong workshops
http://doi.acm.org/10.1145/1272366.1272399	25	Scaling Multiplayer Online Games using Proxy-Server Replication: A Case Study of Quake 2	alonso architecture based case china computer computers databases density design dist distributed engine entertainment entity euro fischer game games gorlatch hall hong hopkins http icdcs ieee infocom interactive internet italy kemme knutsson kong lncs march massively mauve muller multiplayer munster network online paradigms parallel parallelisation pedone peer pisa prentice principles proc processing projects proxy qfusion quake real realm references replication report rokkatan scalability scalable scaling schiper schroter server sourceforge springer steen study support supporting systems tanenbaum technical time turner understanding universitat verlag washington westfalische wiesmann wilhelms workshop xavier