• Non ci sono risultati.

(1)Bibliografia [1] Cern, http://www.cern.ch

N/A
N/A
Protected

Academic year: 2021

Condividi "(1)Bibliografia [1] Cern, http://www.cern.ch"

Copied!
3
0
0

Testo completo

(1)

Bibliografia

[1] Cern, http://www.cern.ch.

[2] Entit`a nel linguaggio xml , http://www.w3.org/2003/entities/.

[3] Grid security infrastructure, http://www.globus.org/security/.

[4] gsoap - soap/xml web services in c and c/c++, http://www.cs.fsu.edu/~engelen/soap.html.

[5] Istituto nazionale di fisica nucleare, http://www.infn.it.

[6] Large hadron collider, http://lhc.web.cern.ch/lhc/.

[7] Scientific linux, http://www.scientificlinux.org/.

[8] The base16, base32, and base64 data encodings, 2003.

[9] Bill Allcock, Joe Bester, John Bresnahan, Ann L. Chervenak, Carl Kessel- man, Sam Meder, Veronika Nefedova, Darcy Quesnel, Steven Tuecke, and Ian Foster. Secure, efficient data transport and replica management for high-performance data-intensive computing. In MSS ’01: Proceedings of the Eighteenth IEEE Symposium on Mass Storage Systems and Technologies, page 13. IEEE Computer Society, 2001.

[10] W. Allcock, I. Foster, S. Tuecke, A. Chervenak, and C. Kesselman. Protocols and services for distributed data-intensive science, 2000.

[11] Rob Baxter. A complete history of the grid (abridged).

[12] N. Borenstein and N. Freed. Mime (multipurpose internet mail extensions):

Mechanisms for specifying and describing the format of internet message bodies, 1992.

83

(2)

[13] Ravi Darbhamulla and Pallavi Tadepalli. Web services demystified. Journal of Computing Sciences in Colleges, (5), 2006.

[14] Andrea Domenici, Flavia Donno, Gianni Pucciani, and Heinz Stockinger.

Constanza design report, 2006.

[15] Zhenhai Duan, Yingfei Dong, and Kartik Gopalan. Push vs. pull:

Implications of protocol design on controlling unwanted traffic.

[16] David Foster. Procurve networking partners with cern to unlock the secrets of the universe. Technical report, 2006.

[17] Ian Foster. What is the grid? a three point checklist. Argonne National Laboratory, University of Chicago, 2002.

[18] Ian Foster and Carl Kesselman. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, 1998.

[19] Ian T. Foster. The anatomy of the grid: Enabling scalable virtual orga- nizations. In Euro-Par ’01: Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing, pages 1–4. Springer-Verlag, 2001.

[20] N. Freed and N. Borenstein. Multipurpose internet mail ex- tensions (mime) part one: Format of internet message bodies.

http://www.faqs.org/rfcs/rfc18.html, 1996.

[21] Gray, Homan, Korth H., and Obermarck R. A strawman analysis of the probability of deadlock. Technical report, IBM, 1981.

[22] Jim Gray, Pat Helland, Patrick E. O’Neil, and Dennis Shasha. The dangers of replication and a solution. In H. V. Jagadish and Inderpal Singh Mumick,

84

(3)

editors, Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Quebec, Canada, June 4-6, 1996, pages 173–182. ACM Press, 1996.

[23] XML Core Working Group. Extensible markup language (xml) 1.1, http://www.w3.org/tr/2006/rec-xml11-20060816/. Agosto 2006.

[24] XML Protocol Working Group. Simple object access protocol 1.2 - part 2, http://www.w3.org/tr/soap12-part2/. Technical report, W3C, Giugno 2003.

[25] XML Schema Working Group. Xml schema part 2: Datatypes, http://www.w3.org/tr/soap12-part2/. Technical report, W3C, Giugno 2003.

[26] Stephen Mohr and Scott Woodgate. Microsoft BizTalk Server 2006 Unleashed. Sams, 2007.

[27] Michael Morrison, David Brownell, and Frank Boumphrey. Xml Unleashed.

Sams, 1999.

[28] Gianni Pucciani. Simulazione di modelli di consistenza per file replicati su sistemi grid. 2003.

[29] Yasushi Saito. Optimistic replication algorithms. pages 42–81. ACM Press, 2005.

[30] S. W. Smith and D. B. Johnson. Minimizing timestamp size for complete- ly asynchronous optimistic recovery with minimal rollback. In SRDS ’96:

Proceedings of the 15th Symposium on Reliable Distributed Systems (SRDS

’96), page 66. IEEE Computer Society, 1996.

85

Riferimenti

Documenti correlati

Siegel, et al, “A Taxonomy for describing Matching and Scheduling Heuristics for Mixed-Machine Heterogeneous Computing Systems”, in Proceedings of the 17 th IEEE Symposium on

•  Nel 1981 il CERN decide di costruire il più grande acceleratore del mondo: il LEP, Collisore elettrone-positrone di 27 km di circonferenza Gli elettroni, al contrario dei

From this measurement the mean force acting on the antiprotons was estimated to be 530 ± 50(stat) ± 350(syst) aN, consistent with the Lorentz force due to the residual magnetic field

Patent applications have been used as a proxy of innovation output in count data models that provide estimates of the timing of CERN procurement impact on the number of pat- ents

12:55– 13:15 Job performance across time: Investigating trajectory classes of performance and their relationship with self efficacy and organizational tenure (M.

- to perform time series analysis using a standardized methodology and evaluate the short term health effects of weather conditions on daily mortality and daily hospital

A deeper examination of such a potential signal would require a more accurate determination of the antiproton production cross section, to constrain the flux of secondary

Le ricerche in fisica delle particelle elementari degli ultimi decenni hanno permesso di avere un quadro molto semplice e soddisfacente dei costituenti elementari: il