Result 1 to 20 of 29 total
Performance characterization of global address space applications: a case study with NWChem. (English)
Concurrency Comput. Pract. Exp. 24, No. 2, 135-154 (2012).
1
Implementing vertical splitting for large scale multidimensional datasets and its evaluations. (English)
Cuzzocrea, Alfredo (ed.) et al., Data warehousing and knowledge discovery. 13th international conference, DaWaK 2011, Toulouse, France, August 29 ‒ September 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23543-6/pbk). Lecture Notes in Computer Science 6862, 208-223 (2011).
2
Tuning collective communication for partitioned global address space programming models. (English)
Parallel Comput. 37, No. 9, 576-591 (2011).
3
Revisiting address space randomization. (English)
Rhee, Kyung-Hyune (ed.) et al., Information security and cryptology ‒ ICISC 2010. 13th international conference, Seoul, Korea, December 1‒3, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-24208-3/pbk). Lecture Notes in Computer Science 6829, 207-221 (2011).
4
A PGAS-based algorithm for the longest common subsequence problem. (English)
Luque, Emilio (ed.) et al., Euro-Par 2008 ‒ parallel processing. 14th international Euro-Par conference, Las Palmas de Gran Canaria, Spain, August 26‒29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85450-0/pbk). Lecture Notes in Computer Science 5168, 654-664 (2008).
5
Data space randomization. (English)
Zamboni, Diego (ed.), Detection of intrusions and malware, and vulnerability assessment. 5th international conference, DIMVA 2008, Paris, France, July 10‒11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-70541-3/pbk). Lecture Notes in Computer Science 5137, 1-22 (2008).
6
From the editor in chief: Middleware’s shrinking middle. (English)
IEEE Internet Computing 10, No. 05, 4-5 (2006).
7
Hierarchical Visualization of Network Intrusion Detection Data. (English)
IEEE Computer Graphics and Applications 26, No.02, 40-47 (2006).
8
On the design and implementation of an effective prefetch strategy for DSM systems. (English)
J. Supercomput. 37, No. 1, 91-112 (2006).
9
Performance of a new CFD flow solver using a hybrid programming paradigm. (English)
J. Parallel Distrib. Comput. 65, No. 4, 414-423 (2005).
10
Performance evaluation and implementation of two adaptive routing algorithms for XGFT networks. (English)
Comput. Inform. 23, No. 5-6, 415-435 (2004).
11
Separating data storage, data computation and resource management. (Chinese)
J. Softw. 15, No. 6, 850-857 (2004).
12
Access Control Mechanisms in a Distributed, Persistent Memory System. (English)
IEEE Transactions on Parallel and Distributed Systems 13, No.10, 1066-1083 (2002).
13
A comparison of three programming models for adaptive applications on the origin2000. (English)
J. Parallel Distrib. Comput. 62, No.2, 241-266 (2002).
14
Single address space implementation in distributed systems. (English)
Concurrency Pract. Exp. 12, No. 4, 251-280 (2000).
15
Linking programs in Mungi. (English)
Edwards, Jenny (ed.), Computer science. ACSC ’99. Proceedings of the 22nd Australasian conference, Auckland, New Zealand, January 18-21, 1999. Singapore: Springer. Aust. Comput. Sci. Commun. 21(1), 312-323 (1999).
16
Experience with executing shared memory programs using fine-grain communication and mutithreading in EM-4 multiprocessor. (English)
Trans. Inf. Process. Soc. Japan 36, No. 7, 1669-1679 (1995).
17
Editorial. (English)
IEEE Transactions on Computers 43, No.09, 994-1003 (1994).
18
Virtual Checkpoints: Architecture and Performance. (English)
IEEE Transactions on Computers 41, No.05, 516-525 (1992).
19
Synthetic Traces for Trace-Driven Simulation of Cache Memories. (English)
IEEE Transactions on Computers 41, No.04, 388-410 (1992).
20
Result 1 to 20 of 29 total
Start
Contact
Print
General Help
