Information Technology Reference
In-Depth Information
Figure 3. Comparison in speed of the two algo-
rithms
Foster, I., Kesselman, C., & Tuecke, S. (2001).
The Anatomy of the Grid: Enabling Scalable Vir-
tual Organizations.
International Journal of High
Performance Computing Applications
, 200-222.
doi:10.1177/109434200101500302
Freier, A. O., Karlton, P., & Kocher, P. C. (1996).
Internet Draft: The SSL Protocol Version 3.0.
The
Internet Engineering Task Force (IETF), Avail-
able at http://wp.netscape.com/eng/ssl3/draft302.
txt,last accessed in November 2007.
Freund, R. F., Gherrity, R. M., Ambrosius, S.,
Campbell, M., Halderman, D., Hensgen, E., &
Keith, T. Kidd, M. Kussow, Lima, J. D., Mi-
rabile, F. L., Moore, L., Rust, B., & Siegel, H.
J. (1998). Scheduling resources in multi-user,
heterogeneous, computing environments with
SMARTNET.
7th IEEE Heterogeneous Comput-
ing Workshop
, (pp. 184-199).
is also observed that SPMinMin is a faster algo-
rithm than MinMin. Thus, SPMinMin is a prime
candidate to be considered as a security aware
scheduler on a computational grid.
REFERENCES
Fujimoto, N., & Hagihara, K. (2003). Near-optimal
dynamic task scheduling of independent coarse-
grained tasks onto a computational grid.
32nd
Annual International Conference on Parallel
Processing (ICPP-03)
, (pp. 391-398).
Apostolopoulos, G., Peris, V., & Debanjan Saha,
D. (1999). Transport Layer Security: How Much
Does it Really Cost.
Proceedings of the IEEE
INFOCOM
. New York.
Jones, M. (2003).
Grid Security - An overview of
methods used to create a secure grid.
Retrieved
from http://www.cse.buffalo.edu/faculty/miller/
Courses/Grid-Seminar/Security.pdf.
Casanova, H., Legrand, A., Zagorodnov, D., &
Berman, F. (2000). Heuristics for scheduling
parameter sweep applications in grid environ-
ments.
The Ninth IEEE Heterogeneous Computing
Workshop (HCW)
,(pp. 349-363).
Naedele, M. (2003). Standards for XML and
Web Services Security.
Computer
,
36
(4), 96-98.
doi:10.1109/MC.2003.1193234
Dierks, T. (2007).
The Transport Layer Security
(TLS) Protocol Version 1.2 Network Resonance,
Inc.
Available at http://www.ietf.org /internet-
drafts/draft-ietf-tls-rfc4346-bis-07.txt.
Paranhos, D., Cirne, W., & Brasileiro, F. (2003).
Trading cycles for information: Using replication
to schedule bag-of-tasks applications on computa-
tional grids.
International Conference on Parallel
and Distributed Computing (Euro-Par)
.
Lecture
Notes in Computer Science
,
2790
, 169-180.
Foster, I., Kesselman, C., Tsudik, G., & Tuecke, S.
(1998).
Security Architecture for Computational
Grids
. ACM Conference on Computers and Se-
curity, (pp. 83-91).
Prabhakar, S., Ribbens, C., & Bora, P. (2002).
Multifaceted web services: An approach to secure
and scalable grid scheduling.
Proceedings of
Euroweb, Oxford, UK.
Search WWH ::
Custom Search