Learn More
" MISRA " , " MISRA C " and the triangle logo are registered trademarks of MIRA Limited, held on behalf of the MISRA Consortium. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical or photocopying, recording or otherwise without the prior written(More)
This paper proposes two techniques for obtaining a sharp lower bound for the multiprocessor scheduling problem (MSP) with non-negligible communication delay. In the proposed techniques, we apply the notion of inevitable communication delay to obtain a nontrivial lower bound on the scheduling length. The effectiveness of the derived bound is evaluated by(More)
  • 1