John Manferdelli

dblp:45/3600 · also John L. Manferdelli · DBLP profile ↗
← Back
9ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5Systems, architecture and hardware · 2Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
GPUs and heterogeneous computing · 23% High-performance computing · 23% Memory systems · 23%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing
fast fourier transform
0.112008
High performance discrete Fourier transforms on graphics processors · SC 2008
GPUs and heterogeneous computing
GPU computing
0.112008
High performance discrete Fourier transforms on graphics processors · SC 2008
Parallel and multicore computing › many-core systems
many-core computing
0.112008
Challenges and Opportunities in Many-Core Computing · Proc. IEEE 2008
Memory systems › memory hierarchy
memory hierarchy optimization
0.112008
High performance discrete Fourier transforms on graphics processors · SC 2008
Cryptographic primitives and cryptanalysis
block cipher cryptanalysis
0.011984
DES Has No Per Round Linear Factors · CRYPTO 1984
Cryptographic primitives and cryptanalysis
linear cryptanalysis
0.011984
DES Has No Per Round Linear Factors · CRYPTO 1984
Cryptographic primitives and cryptanalysis
block cipher
0.011984
DES Has No Per Round Linear Factors · CRYPTO 1984
Cryptographic primitives and cryptanalysis › block cipher
DES
0.011984
DES Has No Per Round Linear Factors · CRYPTO 1984

Methods — techniques the papers use, named apart from their topics

explicit declarations · 0.2domain-specific libraries · 0.2stockham formulation · 0.1modular arithmetic · 0.1mixed radix FFT · 0.1bluestein's algorithm · 0.1linear cryptanalysis · 0.0
YearPublicationVenuePosition
2017 Intra-Cloud and Inter-Cloud Authentication
abstract
Authentication mechanisms available in existing cloud platforms are inadequate for and poorly-suited to modern cloud-based systems. To support this argument, we describe a variety of authentication mechanisms commonly used in the cloud, and we detail how these mechanisms are actually used in one significant open-source service deployed to a popular cloud platform. We further report on authentication mechanisms used and supported by several of the largest cloud platform providers. The evidence shows that authentication mechanisms currently in use are too coarse-grained, require manual configuration and intervention, and are not systematically applied across components and services. We identify opportunities for cloud platforms to support more secure, fine-grained, automated, and systematic authentication within and between cloud-hosted components.
Kevin Walsh 0001, John Manferdelli
CLOUD2
2016 Attestation Transparency: Building secure Internet services for legacy clients
abstract
Internet services can provide a wealth of functionality, yet their usage raises privacy, security and integrity concerns for users. This is caused by a lack of guarantees about what is happening on the server side. As a worst case scenario, the service might be subjected to an insider attack. We use remote attestation of the server to obtain guarantees about the programming of the service. On top of that, we augment Certificate Transparency to distribute information about which services exist and what they do. Combined, this creates a platform that allows legacy clients to obtain security guarantees about Internet services.
Jethro G. Beekman, John Manferdelli, David A. Wagner 0001
AsiaCCS2
2008 Fast scan algorithms on graphics processors
abstract
Scan and segmented scan are important data-parallel primitives for a wide range of applications. We present fast, work-efficient algorithms for these primitives on graphics processing units (GPUs). We use novel data representations that map well to the GPU architecture. Our algorithms exploit shared memory to improve memory performance. We further improve the performance of our algorithms by eliminating shared-memory bank conflicts and reducing the overheads in prior shared-memory GPU algorithms. Furthermore, our algorithms are designed to work well on general data sets, including segmented arrays with arbitrary segment lengths. We also present optimizations to improve the performance of segmented scans based on the segment lengths. We implemented our algorithms on a PC with an NVIDIA GeForce 8800 GPU and compared our results with prior GPU-based algorithms. Our results indicate up to 10x higher performance over prior algorithms on input sequences with millions of elements.
Yuri Dotsenko, Naga K. Govindaraju, Peter-Pike J. Sloan, Charles Boyd, John Manferdelli
ICS5
2008 High performance discrete Fourier transforms on graphics processors
abstract
We present novel algorithms for computing discrete Fourier transforms with high performance on GPUs. We present hierarchical, mixed radix FFT algorithms for both power-of-two and non-power-of-two sizes. Our hierarchical FFT algorithms efficiently exploit shared memory on GPUs using a Stockham formulation. We reduce the memory transpose overheads in hierarchical algorithms by combining the transposes into a block-based multi-FFT algorithm. For non-power-of-two sizes, we use a combination of mixed radix FFTs of small primes and Bluestein's algorithm. We use modular arithmetic in Bluestein's algorithm to improve the accuracy. We implemented our algorithms using the NVIDIA CUDA API and compared their performance with NVIDIA's CUFFT library and an optimized CPU-implementation (Intel's MKL) on a high-end quad-core CPU. On an NVIDIA GPU, we obtained performance of up to 300 GFlops, with typical performance improvements of 2–4× over CUFFT and 8–40× improvement over MKL for large sizes.
Naga K. Govindaraju, Brandon Lloyd, Yuri Dotsenko, Burton Smith, John Manferdelli
SC5
2008 Challenges and Opportunities in Many-Core Computing
abstract
In this paper, we present some of the challenges and opportunities in software development based on the current hardware trends and the impact of massive parallelism on both the software and hardware industry. We indicate some of the approaches that can enable software development to effectively exploit the many-core architectures. Some of these include encapsulating domain-specific knowledge in reusable components, such as libraries, integrating concurrency with languages, and supporting explicit declarations to help compilers and operating system schedulers. Tighter interaction between software and underlying hardware is required to build scalable and portable applications with predictable performance and higher power-efficiency. Overall, many-core computing provides us opportunities to enable new application scenarios that support enhanced functionality and a richer experience for the user on commodity hardware.
John Manferdelli, Naga K. Govindaraju, Chris Crall
Proc. IEEE1
2006 Virtual machines for enterprise desktop security
Paul England, John Manferdelli
Inf. Secur. Tech. Rep.2
2006 New Vistas in elliptic curve cryptography
Brian A. LaMacchia, John Manferdelli
Inf. Secur. Tech. Rep.2
2004 NGSCB: A Trusted Open System
Marcus Peinado, Yuqun Chen, Paul England, John Manferdelli
ACISP4
1984 DES Has No Per Round Linear Factors
James A. Reeds, John Manferdelli
CRYPTO2