Sciweavers

5448 search results - page 103 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
IPPS
1997
IEEE
15 years 8 months ago
A Compile-Time Partitioning Strategy for Non-Rectangular Loop Nests
This paper presents a compile-time scheme for partitioning non-rectangular loop nests which consist of inner loops whose bounds depend on the index of the outermost, parallel loop...
Rizos Sakellariou
IPPS
2009
IEEE
15 years 10 months ago
DMTCP: Transparent checkpointing for cluster computations and the desktop
DMTCP (Distributed MultiThreaded CheckPointing) is a transparent user-level checkpointing package for distributed applications. Checkpointing and restart is demonstrated for a wid...
Jason Ansel, Kapil Arya, Gene Cooperman
IPPS
2005
IEEE
15 years 9 months ago
Code-Size Minimization in Multiprocessor Real-Time Systems
— Program code size is a critical factor in determining the manufacturing cost of many embedded systems, particularly those aimed at the extremely costconscious consumer market. ...
Sanjoy K. Baruah, Nathan Fisher
ICDCS
1995
IEEE
15 years 7 months ago
Analysis of Resource Lower Bounds in Real-Time Applications
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...
Raed Alqadi, Parameswaran Ramanathan
SPAA
2005
ACM
15 years 9 months ago
The expansion and mixing time of skip graphs with applications
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
James Aspnes, Udi Wieder