Results 1 - 10 of 9,405

ONLINE SCHEDULING OF MALLEABLE PARALLEL JOBS

by Richard A. Dutton, Weizhen Mao
"... In this paper, we study a parallel job scheduling model which takes into account both computation time and the overhead from communication between processors. Assuming that a job Jj has a processing requirement pj and is assigned to kj processors for parallel execution, then the execution time will ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
for jobs running in parallel on multiple processors. Using this model, we will study the online algorithm Earliest Completion Time (ECT) and show a lower bound for the competitive ratio of ECT for m ≥ 2 processors. For m ≤ 4, we show the matching upper bound to complete the competitive analysis for m = 2

Block-wise Non-malleable Codes

by unknown authors , 2015
"... Non-malleable codes, introduced by Dziembowski, Pietrzak, and Wichs (ICS ’10), provide the guarantee that if a codeword c of a message m, is modified by a tampering function f to c′, then c ′ either decodes to m or to “something unrelated ” to m. It is known that non-malleable codes cannot exist for ..."
Abstract - Add to MetaCart
Non-malleable codes, introduced by Dziembowski, Pietrzak, and Wichs (ICS ’10), provide the guarantee that if a codeword c of a message m, is modified by a tampering function f to c′, then c ′ either decodes to m or to “something unrelated ” to m. It is known that non-malleable codes cannot exist

MI: Cross-layer Malleable Identity

by Soon Hin Khor , Nict Japan , Akihiro Nakao
"... Abstract-Access to Internet services is granted based on application-layer user identities, which also offer accountability. The revered layered network model dictates a disparate networklayer identity scheme for systems. We challenge this religious layered model adherence by demonstrating the prac ..."
Abstract - Add to MetaCart
Abstract-Access to Internet services is granted based on application-layer user identities, which also offer accountability. The revered layered network model dictates a disparate networklayer identity scheme for systems. We challenge this religious layered model adherence by demonstrating

Non-malleable Codes from Additive Combinatorics

by Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett , 2013
"... Non-malleable codes provide a useful and meaningful security guarantee in situations where traditional error-correction (and even error-detection) is impossible; for example, when the attacker can completely overwrite the encoded message. Informally, a code is non-malleable if the message contained ..."
Abstract - Cited by 18 (5 self) - Add to MetaCart
Non-malleable codes provide a useful and meaningful security guarantee in situations where traditional error-correction (and even error-detection) is impossible; for example, when the attacker can completely overwrite the encoded message. Informally, a code is non-malleable if the message contained

Scheduling on hierarchical clusters using Malleable Tasks

by Pierre-François Dutot, Denis Trystram - IN: PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES, ACM , 2001
"... The model of malleable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application at a larger level of granularity than in other models (corresponding typically to numerical routines) where the tasks ca ..."
Abstract - Cited by 13 (6 self) - Add to MetaCart
, designing efficient software that take full advantage of such systems remains difficult. This work describes a $2-2/k$ approximation algorithm for scheduling a set of independent malleable tasks for the minimization of the parallel execution time, where $k$ is a power of $2$ ($k > 2$). For $k=2$, a

Linear-time Approximation Schemes for Scheduling Malleable Parallel Tasks

by Klaus Jansen, Lorant Porkolab - Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms , 1999
"... A malleable parallel task is one whose execution time is a function of the number of (identical) processors alloted to it. We study the problem of scheduling a set of n independent malleable tasks on a xed number of parallel processors, and propose an approximation scheme that for any xed > 0, c ..."
Abstract - Cited by 35 (14 self) - Add to MetaCart
A malleable parallel task is one whose execution time is a function of the number of (identical) processors alloted to it. We study the problem of scheduling a set of n independent malleable tasks on a xed number of parallel processors, and propose an approximation scheme that for any xed > 0

Online Malleable Job Scheduling for m ≤ 3

by Jessen T. Havill
"... A malleable parallel job is one that may be assigned to any number of processors in a parallel computing environment. In our particular problem, we assume that the execution time of a job j with processing requirement pj is pj/kj + (kj − 1)c if the job is assigned to kj ∈ {1, 2,...,m} processors, wh ..."
Abstract - Add to MetaCart
A malleable parallel job is one that may be assigned to any number of processors in a parallel computing environment. In our particular problem, we assume that the execution time of a job j with processing requirement pj is pj/kj + (kj − 1)c if the job is assigned to kj ∈ {1, 2,...,m} processors

Improved Upper Bounds for Online Malleable Job Scheduling

by Nathaniel Kell , Jessen Havill
"... Abstract In this paper, we study online algorithms that schedule malleable jobs, i.e., jobs that can be parallelized on any subset of the available m identical machines. We study a model that accounts for the tradeoff between multiprocessor speedup and overhead time, namely, if job j has processing ..."
Abstract - Add to MetaCart
Abstract In this paper, we study online algorithms that schedule malleable jobs, i.e., jobs that can be parallelized on any subset of the available m identical machines. We study a model that accounts for the tradeoff between multiprocessor speedup and overhead time, namely, if job j has

Network tomography: recent developments

by Rui Castro, Mark Coates, Gang Liang, Robert Nowak, Bin Yu - Statistical Science , 2004
"... Today's Int ernet is a massive, dist([/#][ net work which cont inuest o explode in size as ecommerce andrelatH actH]M/# grow. Thehet([H(/#]H( and largelyunregulatS stregula of t/ Int/HH3 renderstnde such as dynamicroutc/[ opt2]3fl/ service provision, service level verificatflH( and det(2][/ of ..."
Abstract - Cited by 132 (4 self) - Add to MetaCart
Today's Int ernet is a massive, dist([/#][ net work which cont inuest o explode in size as ecommerce andrelatH actH]M/# grow. Thehet([H(/#]H( and largelyunregulatS stregula of t/ Int/HH3 renderstnde such as dynamicroutc/[ opt2]3fl/ service provision, service level verificatflH( and det(2

Tamper Detection and Continuous Non-Malleable Codes

by Zahra Jafargholi, Daniel Wichs , 2014
"... We consider a public and keyless code (Enc,Dec) which is used to encode a message m and derive a codeword c = Enc(m). The codeword can be adversarially tampered via a function f ∈ F from some “tampering function family ” F, resulting in a tampered value c ′ = f(c). We study the different types of s ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
codes, which were introduced by Dziembowski, Pietrzak and Wichs (ICS ’10) and require that Dec(c′) either decodes to the original message m, or to some unrelated value (possibly ⊥) that doesn’t provide any information about m. We give a modular construction of non-malleable codes by
Results 1 - 10 of 9,405