Sciweavers

1855 search results - page 64 / 371
» A coding theorem for distributed computation
Sort
View
PPOPP
1995
ACM
15 years 4 months ago
Optimistic Active Messages: A Mechanism for Scheduling Communication with Computation
Low-overhead message passing is critical to the performance of many applications. Active Messages[27] reduce the software overhead for message handling: messages are run as handle...
Deborah A. Wallach, Wilson C. Hsieh, Kirk L. Johns...
PPPJ
2006
ACM
15 years 6 months ago
Enabling Java mobile computing on the IBM Jikes research virtual machine
Today’s complex applications must face the distribution of data and code among different network nodes. Java is a wide-spread language that allows developers to build complex so...
Giacomo Cabri, Letizia Leonardi, Raffaele Quitadam...
IPPS
2009
IEEE
15 years 7 months ago
Fast development of dense linear algebra codes on graphics processors
—We present an application programming interface (API) for the C programming language that facilitates the development of dense linear algebra algorithms on graphics processors a...
M. Jesús Zafont, Alberto F. Martín, ...
SPAA
1996
ACM
15 years 4 months ago
An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
Robert D. Blumofe, Matteo Frigo, Christopher F. Jo...
WCRE
2010
IEEE
14 years 10 months ago
Reverse Engineering Self-Modifying Code: Unpacker Extraction
—An important application of binary-level reverse engineering is in reconstructing the internal logic of computer malware. Most malware code is distributed in encrypted (or “pa...
Saumya K. Debray, Jay Patel